Prompt Mechanisms for Online Auctions

DOI10.1007/978-3-540-79309-0_16MaRDI QIDQ5459982zbMATH OpenOpenAlexFDO

Authors Shahar Dobzinski, Lisa Fleischer, Richard 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)

Recommendations

• Prompt mechanism for online auctions with multi-unit demands
• Prompt Mechanism for Online Auctions with Multi-unit Demands
• scientific article; zbMATH DE number 2119761
• Competitive analysis of incentive compatible on-line auctions
• Online ascending auctions for gradually expiring items

Cites work

• Algorithmic mechanism design (extended abstract)
• Algorithms – ESA 2004
• Better online buffer management
• Buffer overflow management in QoS switches
• Competitive analysis of incentive compatible on-line auctions
• Competitive auctions
• Considering suppressed packets improves buffer management in QoS switches
• Online ascending auctions for gradually expiring items
• Online scheduling with partial job values: does timesharing or randomization help?
• STACS 2004
• Truthful approximation mechanisms for restricted combinatorial auctions

Cited in

(21)

• Competitive analysis of incentive compatible on-line auctions
• Online incentive-compatible mechanisms for traffic intersection auctions
• 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
• The dynamic Vickrey auction
• Dual mechanism for an online retailer
• The loss of serving in the dark
• Clairvoyant mechanisms for online auctions
• Prompt Mechanism for Online Auctions with Multi-unit Demands
• Online ascending auctions for gradually expiring items
• Near-optimal online auctions
• Online mechanism design (randomized rounding on the fly)
• Serving in the dark should be done non-uniformly
• Online mechanisms
• Truthful auction for CPU time slots
• Truthful multi-parameter auctions with online supply: an impossible combination
• Efficiency levels in sequential auctions with dynamic arrivals
• Truthful prompt scheduling for minimizing sum of completion times
• Truthful Matching with Online Items and Offline Agents

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459982)