Prompt Mechanisms for Online Auctions
From MaRDI portal
Publication:5459982
DOI10.1007/978-3-540-79309-0_16zbMATH Open1136.91399OpenAlexW1585689770MaRDI QIDQ5459982FDOQ5459982
Richard Cole, Shahar Dobzinski, Lisa Fleischer
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
Recommendations
Auctions, bargaining, bidding and selling, and other market models (91B26) Communication networks in operations research (90B18)
Cites Work
- Algorithmic mechanism design (extended abstract)
- Online scheduling with partial job values: does timesharing or randomization help?
- Truthful approximation mechanisms for restricted combinatorial auctions
- Competitive auctions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive analysis of incentive compatible on-line auctions
- Online ascending auctions for gradually expiring items
- STACS 2004
- Algorithms – ESA 2004
- Buffer overflow management in QoS switches
Cited In (14)
- Dual mechanism for an online retailer
- Prompt mechanism for online auctions with multi-unit demands
- Online ascending auctions for gradually expiring items
- Title not available (Why is that?)
- Auctions with online supply
- Serving in the Dark should be done Non-Uniformly
- Efficiency levels in sequential auctions with dynamic arrivals
- Truthful Matching with Online Items and Offline Agents
- The loss of serving in the dark
- Online mechanisms
- Online pricing for multi-type of items
- Prompt Mechanism for Online Auctions with Multi-unit Demands
- Competitive analysis of incentive compatible on-line auctions
- The dynamic Vickrey auction
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)
