Access the full text.
Sign up today, get DeepDyve free for 14 days.
Theodore Groves (1973)
Incentives in TeamsEconometrica, 41
Tom Lee (1985)
Competition and information acquisition in first price auctionsEconomics Letters, 18
D. Parkes (2002)
Price-Based Information Certificates for Minimal-Revelation Combinatorial Auctions
M. Stegeman (1996)
Participation Costs and Efficient AuctionsJournal of Economic Theory, 71
S. Vries, J. Schummer, R. Vohra (2007)
On ascending Vickrey auctions for heterogeneous objectsJ. Econ. Theory, 132
Craig Boutilier, H. Hoos (2001)
Bidding Languages for Combinatorial Auctions
Chiaki Hara, I. Segal, S. Tadelis (1997)
Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green
(2003)
Proxied Multiattribute Auctions'. In: Fourth ACM Conf. on Electronic Commerce (EC'03)
Adi Sunderam, D. Parkes (2003)
Preference elicitation in proxied multiattribute auctions
A. Gibbard (1973)
Manipulation of Voting Schemes: A General ResultEconometrica, 41
Tuomas Sandholm (1999)
Automated negotiationCommun. ACM, 42
J. Bakos (1997)
Reducing buyer search costs: implications for electronic marketplacesManagement Science, 43
Carl Ehrman, Michael Peters (1994)
Sequential selling mechanismsEconomic Theory, 4
Jerry Green, J. Laffont (1977)
Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public GoodsEconometrica, 45
A. Greenwald, J. Kephart (1999)
Shopbots and Pricebots
William Samuelson (1985)
Competitive bidding with entry costsEconomics Letters, 17
Liad Blumrosen, N. Nisan (2002)
Auctions with severely bounded communicationThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
D. Lien (1985)
A note on bimatrix games with an unknown payoff matrixEconomics Letters, 19
Robert Guttman, P. Maes (1998)
Cooperative vs. Competitive Multi-Agent Negotiations in Retail Electronic Commerce
Benoît Hudson, T. Sandholm (2004)
Effectiveness of query types and policies for preference elicitation in combinatorial auctionsProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004.
C. Caplice, Y. Sheffi (2005)
Combinatorial Auctions for Truckload Transportation
N. Nisan, I. Segal (2006)
The communication requirements of efficient allocations and supporting pricesJ. Econ. Theory, 129
Daniel Reeves, Michael Wellman
Computing Equilibrium Strategies in Infinite Games of Incomplete Information
Paula Brewer (1999)
Decentralized computation procurement and computational robustness in a smart marketEconomic Theory, 13
D. Parkes, L. Ungar (2001)
Iterative combinatorial auctions: achieving economic and computational efficiency
D. Mishra, D. Parkes (2005)
Ascending Price Vickrey Auctions for General Valuations
Vincent Conitzer, T. Sandholm (2004)
Computational criticisms of the revelation principle
Dan Levin, James Smith (1994)
Equilibrium in Auctions with EntryThe American Economic Review, 84
A. Ronen (2001)
Mechanism design with incomplete languages
Peter Wurman, Michael Wellman, W. Walsh (2002)
Specifying Rules for Electronic AuctionsAI Mag., 23
K. Larson, T. Sandholm (2004)
Experiments on deliberation equilibria in auctionsProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004.
Benoît Hudson, T. Sandholm (2002)
Effectiveness of Preference Elicitation in Combinatorial Auctions
Olivier Compte, P. Jehiel (2007)
Auctions and Information acquisition: Sealed-bid or Dynamic Formats?Levine's Bibliography
Noam Nisany, Ilya Segalz (2003)
The Communication Requirements of E¢cient Allocations and Supporting Lindahl Prices¤
N. Nisan, I. Segal (2002)
The Communication Complexity of Efficient Allocation Problems
T. Sandholm (1996)
Limitations of the Vickrey Auction in Computational Multiagent Systems
Sébastien Lahaie, D. Parkes (2004)
Applying learning algorithms to preference elicitation
P. Jehiel (2000)
On the virtues of the ascending price auction : New insights in the private value setting
K. Larson, T. Sandholm (2001)
Costly valuation computation in auctions
Stuart Russell, Eric Wefald (1989)
Principles of MetareasoningArtif. Intell., 49
E. Cantillon, Martin Pesendorfer, P. Cramton, Y. Shoham, R. Steinberg (2006)
Auctioning bus routes: the London experienceResearch Papers in Economics
T. Sandholm (1993)
An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations
W. Vickrey (1961)
Counterspeculation, Auctions, And Competitive Sealed TendersJournal of Finance, 16
Liad Blumrosen, N. Nisan, I. Segal (2003)
Multi-player and Multi-round Auctions with Severely Bounded Communication
C. Kolstad, Rolando Guzmán (1999)
Information and the Divergence between Willingness to Accept and Willingness to PayJournal of Environmental Economics and Management, 38
D. Parkes, L. Ungar, Dean Foster (1998)
Accounting for Cognitive Costs in On-Line Auction Design
Lawrence Ausubel, Paul Milgrom (2002)
Ascending Auctions with Package BiddingThe B.E. Journal of Theoretical Economics, 1
D. Lehmann, R. Müller, Tuomas Sandholm (2003)
The Winner Determination Problem
D. Lehmann, Liadan O'Callaghan, Y. Shoham (2002)
Truth revelation in approximately efficient combinatorial auctionsArXiv, cs.GT/0202017
R. McAfee, J. Mcmillan (1996)
Analyzing the Airwaves AuctionJournal of Economic Perspectives, 10
Kyna Fong (2003)
Multi-Stage Information Acquisition in Auction Design
Sandholm and
D. Mishra, D. Parkes (2004)
Ascending Price Vickrey Auctions Using Primal-Dual Algorithms∗
A. Mas-Colell, M.D. Whinston, J.R. Green (1995)
Microeconomic Theory
P. Cramton, Y. Shoham, Richard Steinberg (2005)
Combinatorial Auctions
W. Conen, T. Sandholm (2001)
Preference elicitation in combinatorial auctions
Paul Milgrom, R. Weber (1982)
A theory of auctions and competitive biddingEconometrica, 50
Avrim Blum, J. Jackson, T. Sandholm, Martin Zinkevich (2004)
Preference Elicitation and Query Learning
K. Larson, T. Sandholm (2002)
An alternating offers bargaining model for computationally limited agents
E. Clarke (1971)
Multipart pricing of public goodsPublic Choice, 11
D. Parkes, L. Ungar (2000)
Iterative Combinatorial Auctions: Theory and Practice
(2000)
Mechanism theory'. In: The Encyclopedia of Life Support Systems
W. Conen, T. Sandholm (2002)
Partial-revelation VCG mechanism for combinatorial auctions
D. Parkes, J. Kalagnanam (2002)
Iterative Multiattribute Vickrey Auctions
R. Holzman, Noa Kfir-Dahav, Dov Monderer, Moshe Tennenholtz (2002)
Bundling equilibrium in combinatorial auctionsArXiv, cs.GT/0201010
J. Ledyard (1993)
The Design of Coordination Mechanisms and Organizational ComputingJournal of Organizational Computing and Electronic Commerce, 3
N. Nisan, Amir Ronen (2001)
Algorithmic Mechanism DesignGames Econ. Behav., 35
D. Parkes, L. Ungar (2000)
Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment
D. Lehmann, Liaden O'Callaghan, Y. Shoham (2001)
Truth revelation in rapid, approximately efficient combinatorial auctions
K. Larson, T. Sandholm (2001)
Bargaining with limited computation: Deliberation equilibriumArtif. Intell., 132
D. Parkes, J. Kalagnanam (2005)
Models for Iterative Multiattribute Procurement AuctionsManag. Sci., 51
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations. Careful design can also lead to more efficient outcomes when elicitation is too costly to permit perfect allocative efficiency. An incremental revelation principle is developed and used to motivate the role of proxied and indirect auction designs. Proxy agents, situated between bidders and an auction, can be used to maintain partial information about bidder preferences, to compute equilibrium bidding strategies based on the available information, and to elicit additional preference information as required. We derive information-theoretic elicitation policies for proxy agents under a simple model of costly elicitation across different auction designs. An experimental analysis demonstrates that indirect mechanisms, such as ascending-price auctions, can achieve better allocative efficiency with less preference elicitation than sealed-bid (direct) auctions because they promote better decisions about preference elicitation.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 30, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.