Prompt Mechanisms for Online Auctions
From MaRDI portal
Publication:5459982
Recommendations
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)- Dual mechanism for an online retailer
- Online ascending auctions for gradually expiring items
- Online mechanism design (randomized rounding on the fly)
- Serving in the dark should be done non-uniformly
- Near-optimal online auctions
- Prompt mechanism for online auctions with multi-unit demands
- Online incentive-compatible mechanisms for traffic intersection auctions
- Online ascending auctions for gradually expiring items
- scientific article; zbMATH DE number 7378697 (Why is no real title available?)
- Auctions with online supply
- Clairvoyant mechanisms for online auctions
- 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 Matching with Online Items and Offline Agents
- The loss of serving in the dark
- Online mechanisms
- Online pricing for multi-type of items
- Competitive analysis of incentive compatible on-line auctions
- Prompt Mechanism for Online Auctions with Multi-unit Demands
- 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)