Management Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANAGEMENT SCIENCE
Vol. 51, No. 3, March 2005, pp. 419-434
DOI: 10.1287/mnsc.1040.0334
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Kwasnica, A. M.
Right arrow Articles by DeMartini, C.
Right arrow Search for Related Content

A New and Improved Design for Multiobject Iterative Auctions

Anthony M. Kwasnica, John O. Ledyard, Dave Porter, Christine DeMartini

Smeal College of Business, Pennsylvania State University, University Park, Pennsylvania 16802
Division of the Humanities and Social Sciences, California Institute of Technology, Pasadena, California 91125
Interdisciplinary Center for Economic Science, George Mason University, Fairfax, Virginia 22030
RAND, Santa Monica, California 90407

kwasnica{at}psu.edu
jledyard{at}hss.caltech.edu
dporter4{at}gmu.edu
martini{at}rand.org

In this paper we present a new improved design for multiobject auctions and report on the results of experimental tests of that design. We merge the better features of two extant but very different auction processes, the Simultaneous Multiple Round (SMR) design used by the FCC to auction the electromagnetic spectrum and the Adaptive User Selection Mechanism (AUSM) of Banks et al. (1989, "Allocating uncertain and unresponsive resources: An experimental approach," RAND Journal of Economics, Vol. 20, No. 1, pp. 1–25). Then, by adding one crucial new feature, we are able to create a new design, the Resource Allocation Design (RAD) auction process, which performs better than both. Our experiments demonstrate that the RAD auction achieves higher efficiencies, lower bidder losses, higher net revenues, and faster times to completion without increasing the complexity of a bidder's problem.

Key Words: auctions; experimental economics; combinatorial auctions
History: Received: May 22, 2002;


This article has been cited by other articles:


Home page
Information Systems ResearchHome page
G. Adomavicius, A. Gupta, and D. Zhdanov
Designing Intelligent Software Agents for Auctions with Limited Information Feedback
Information Systems Research, December 1, 2009; 20(4): 507 - 526.
[Abstract] [PDF]


Home page
Information Systems ResearchHome page
M. Bichler, P. Shabalin, and A. Pikovsky
A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats
Information Systems Research, March 1, 2009; 20(1): 33 - 59.
[Abstract] [PDF]


Home page
InterfacesHome page
T. Sandholm, D. Levine, M. Concordia, P. Martyn, R. Hughes, J. Jacobs, and D. Begg
Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization
Interfaces, January 1, 2006; 36(1): 55 - 68.
[Abstract] [PDF]


Home page
Management ScienceHome page
C.-H. Chen-Ritzo, T. P. Harrison, A. M. Kwasnica, and D. J. Thomas
Better, Faster, Cheaper: An Experimental Analysis of a Multiattribute Reverse Auction Mechanism with Restricted Information Feedback
Management Science, December 1, 2005; 51(12): 1753 - 1762.
[Abstract] [PDF]


Home page
Management ScienceHome page
G. Anandalingam, R. W. Day, and S. Raghavan
The Landscape of Electronic Market Design
Management Science, March 1, 2005; 51(3): 316 - 327.
[Abstract] [PDF]


Home page
Management ScienceHome page
R. H. Kwon, G. Anandalingam, and L. H. Ungar
Iterative Combinatorial Auctions with Bidder-Determined Combinations
Management Science, March 1, 2005; 51(3): 407 - 418.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.