| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
|
|
|
|||||||
|
|||||||||
Faculty of Management and Rutgers Center for Operations Research, Rutgers University, New Brunswick, New Jersey 08903-5062
There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of nonconflicting bids can be difficult. We analyze this problem, identifying several different structures of permitted combinational bids for which computational tractability is constructively demonstrated and some structures for which computational tractability cannot be guaranteed.
BRICS, Department of Computer Science, University of Aarhus, Denmark
Faculty of Management and Rutgers Center for Operations Research, Rutgers University, New Brunswick, New Jersey 08903-5062
This article has been cited by other articles:
|
|
 |
|
  R. L.-Y. Chen, S. AhmadBeygi, A. Cohn, D. R. Beil, and A. Sinha Solving Truckload Procurement Auctions Over an Exponential Number of Bundles Transportation Science, November 1, 2009; 43(4): 493 - 510. [Abstract] [PDF]
|
|
|
|
 |
|
 R. W. Day and S. Raghavan Matrix Bidding in Combinatorial Auctions Operations Research, July 1, 2009; 57(4): 916 - 933. [Abstract] [PDF]
|
|
|
|
 |
|
 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]
|
|
|
|
 |
|
 R. M. Harstad and A. S. Pekec Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf Interfaces, September 1, 2008; 38(5): 367 - 380. [Abstract] [PDF]
|
|
|
|
|
|
A. Lim, B. Rodrigues, and Z. Xu Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees Operations Research, May 1, 2008; 56(3): 758 - 771. [Abstract] [PDF]
|
|
|
|
 |
|
 R. Bapna, S. Das, R. Garfinkel, and J. Stallaert A Market Design for Grid Computing INFORMS Journal on Computing, January 1, 2008; 20(1): 100 - 111. [Abstract] [PDF]
|
|
|
|
 |
|
 R. W. Day and S. Raghavan Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions Management Science, September 1, 2007; 53(9): 1389 - 1406. [Abstract] [PDF]
|
|
|
|
|
|
Z. Guo, G. J. Koehler, and A. B. Whinston A Market-Based Optimization Algorithm for Distributed Systems Management Science, August 1, 2007; 53(8): 1345 - 1358. [Abstract] [PDF]
|
|
|
|
|
|
M. H. Rothkopf Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical Operations Research, March 1, 2007; 55(2): 191 - 197. [Abstract] [PDF]
|
|
|
|
|
|
G. Adomavicius and A. Gupta Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions Information Systems Research, June 1, 2005; 16(2): 169 - 185. [Abstract] [PDF]
|
|
|
|
|
|
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]
|
|
|
|
|
|
T. Sandholm, S. Suri, A. Gilpin, and D. Levine CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions Management Science, March 1, 2005; 51(3): 374 - 390. [Abstract] [PDF]
|
|
|
|
|
|
O. Gunluk, L. Ladanyi, and S. de Vries A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions Management Science, March 1, 2005; 51(3): 391 - 406. [Abstract] [PDF]
|
|
|
|
|
|
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]
|
|
|
|
|
|
A. M. Kwasnica, J. O. Ledyard, D. Porter, and C. DeMartini A New and Improved Design for Multiobject Iterative Auctions Management Science, March 1, 2005; 51(3): 419 - 434. [Abstract] [PDF]
|
|
|
|
|
|
J. L. Jones and G. J. Koehler A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions INFORMS Journal on Computing, January 1, 2005; 17(4): 475 - 489. [Abstract] [PDF]
|
|
|
|
|
|
J. Gallien and L. M. Wein A Smart Market for Industrial Procurement with Capacity Constraints Management Science, January 1, 2005; 51(1): 76 - 91. [Abstract] [PDF]
|
|
|
|
|
|
E. Katok and A. E. Roth Auctions of Homogeneous Goods with Increasing Returns: Experimental Comparison of Alternative "Dutch" Auctions Management Science, August 1, 2004; 50(8): 1044 - 1063. [Abstract] [PDF]
|
|
|
|
|
|
E. J. Pinker, A. Seidmann, and Y. Vakrat Managing Online Auctions: Current Business and Research Issues Management Science, November 1, 2003; 49(11): 1457 - 1484. [Abstract] [PDF]
|
|
|
|
|
|
A. Pekec and M. H. Rothkopf Combinatorial Auction Design Management Science, November 1, 2003; 49(11): 1485 - 1503. [Abstract] [PDF]
|
|
|
|
|
|
M. Fan, J. Stallaert, and A. B. Whinston Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market Information Systems Research, March 1, 2003; 14(1): 1 - 22. [Abstract] [PDF]
|
|
|
|
|
|
G. Hohner, J. Rich, E. Ng, G. Reid, A. J. Davenport, J. R. Kalagnanam, H. S. Lee, and C. An Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers Interfaces, January 1, 2003; 33(1): 23 - 35. [Abstract] [PDF]
|
|
|
|
|
|
R. Epstein, L. Henriquez, J. Catalan, G. Y. Weintraub, and C. Martinez A Combinational Auction Improves School Meals in Chile Interfaces, November 1, 2002; 32(6): 1 - 14. [Abstract] [PDF]
|
|
|
|
|
|
S. Ba, J. Stallaert, and A. B. Whinston Optimal Investment in Knowledge Within a Firm Using a Market Mechanism Management Science, September 1, 2001; 47(9): 1203 - 1219. [Abstract] [PDF]
|
|
|
|
|
|
F. Kelly and R. Steinberg A Combinatorial Auction with Multiple Winners for Universal Service Management Science, April 1, 2000; 46(4): 586 - 596. [Abstract] [PDF]
|
|
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
