Prompt mechanism for online auctions with multi-unit demands
From MaRDI portal
Publication:2355988
DOI10.1007/s10878-014-9754-9zbMath1319.90059MaRDI QIDQ2355988
Publication date: 28 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9754-9
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Semi-online scheduling for jobs with release times
- Multi-bidding strategy in sponsored search auctions
- Online scheduling with a buffer on related machines
- Online scheduling with partial job values: does timesharing or randomization help?
- Equilibria of GSP for Range Auction
- Prompt Mechanism for Ad Placement over Time
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- Knapsack auctions
- Computing and Combinatorics
- STACS 2004
- Prompt Mechanisms for Online Auctions
- Algorithms – ESA 2004