Auctions with severely bounded communication
- 26 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial AuctionsManagement Science, 2005
- Coarse MatchingEconometrica, 2002
- Envelope Theorems for Arbitrary Choice SetsEconometrica, 2002
- Bidding and allocation in combinatorial auctionsPublished by Association for Computing Machinery (ACM) ,2000
- Competitive analysis of incentive compatible on-line auctionsPublished by Association for Computing Machinery (ACM) ,2000
- Last Minute Bidding and the Rules for Ending Second-Price Auctions: Theory and Evidence from a Natural Experiment on the InternetPublished by National Bureau of Economic Research ,2000
- Algorithms for Selfish AgentsPublished by Springer Nature ,1999
- Pricing in computer networksACM SIGCOMM Computer Communication Review, 1996
- Optimal Auction DesignMathematics of Operations Research, 1981
- Counterspeculation, Auctions, and Competitive Sealed TendersThe Journal of Finance, 1961