Prompt Mechanisms for Online Auctions

DOI10.1007/978-3-540-79309-0_16zbMath1136.91399OpenAlexW1585689770MaRDI QIDQ5459982

Shahar Dobzinski, Lisa K. Fleischer, Richard John Cole

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_16

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (10)

Serving in the Dark should be done Non-Uniformly ⋮ The loss of serving in the dark ⋮ Unnamed Item ⋮ The dynamic Vickrey auction ⋮ Efficiency levels in sequential auctions with dynamic arrivals ⋮ Online ascending auctions for gradually expiring items ⋮ Online pricing for multi-type of items ⋮ Auctions with online supply ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online scheduling with partial job values: does timesharing or randomization help?
• Competitive analysis of incentive compatible on-line auctions
• Competitive auctions
• Truthful approximation mechanisms for restricted combinatorial auctions
• Algorithmic mechanism design (extended abstract)
• Buffer overflow management in QoS switches
• STACS 2004
• Algorithms – ESA 2004

This page was built for publication: Prompt Mechanisms for Online Auctions