An optimal auction for capacity constrained bidders: a network perspective
From MaRDI portal
Publication:1006569
DOI10.1007/S00199-007-0312-XzbMATH Open1156.91356OpenAlexW2073603519MaRDI QIDQ1006569FDOQ1006569
Authors: Alexey Malakhov, Rakesh V. Vohra
Publication date: 25 March 2009
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-007-0312-x
Recommendations
Linear programming (90C05) Auctions, bargaining, bidding and selling, and other market models (91B26) Stochastic network models in operations research (90B15)
Cites Work
Cited In (16)
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
- Strategyproof auction mechanisms for network procurement
- An auction mechanism for allocating the bandwidth of networks to their users
- Auction design for the efficient allocation of service capacity under congestion
- Value-Based Network Externalities and Optimal Auction Design
- Selling two identical objects
- On optimal mechanism design for a sequencing problem
- Optimal multi-unit mechanisms with private demands
- Auctions versus private negotiations in buyer-seller networks
- Foundations of mechanism design: a tutorial. II. Advanced concepts and results
- Randomized mechanism design for decentralized network scheduling
- Analysis of Decentralized Quantized Auctions on Cooperative Networks
- Revisiting the foundations of dominant-strategy mechanisms
- Weak and strong multimarket bidding rings
- Generalized reduced-form auctions: a network-flow approach
- Rank-preserving multidimensional mechanisms: an equivalence between identical-object and heterogeneous-object models
This page was built for publication: An optimal auction for capacity constrained bidders: a network perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006569)