BOB: Improved winner determination in combinatorial auctions and generalizations

Andersson, 2000, Integer programming for combinatorial auction winner determination, 39 Boutilier, 1999, Sequential auctions for the allocation of resources with complementarities, 527 C. DeMartini, A. Kwasnica, J. Ledyard, D. Porter, A new and improved design for multi-object iterative auctions, Technical Report 1054, California Institute of Technology, Social Science, September 1999 Edmonds, 1965, Maximum matching and a polyhedron with 0, 1 vertices, J. Res. Nat. Bur. Standards B, 69, 125, 10.6028/jres.069B.013 Eschen, 1993, An O(n2) algorithm for circular-arc graph recognition, 128 Fujishima, 1999, Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches, 548 Gonen, 2000, Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics, 13 Håstad, 1999, Clique is hard to approximate within n1−ε, Acta Math., 182, 105, 10.1007/BF02392825 Hoos, 2000, Solving combinatorial auctions using stochastic local search, 22 Kelly, 2000, A combinatorial auction with multiple winners for universal services, Management Sci., 46, 586, 10.1287/mnsc.46.4.586.12054 Korte, 1989, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput., 18, 68, 10.1137/0218005 Lehmann, 2003, Truth revelation in rapid, approximately efficient combinatorial auctions, J. ACM Leyton-Brown, 2000, An algorithm for multi-unit combinatorial auctions McAfee, 1996, Analyzing the airwaves auction, J. Economic Perspectives, 10, 159, 10.1257/jep.10.1.159 McMillan, 1994, Selling spectrum rights, J. Economic Perspectives, 8, 145, 10.1257/jep.8.3.145 Myerson, 1983, Efficient mechanisms for bilateral exchange, J. Economic Theory, 28, 265, 10.1016/0022-0531(83)90048-0 Nisan, 2000, Bidding and allocation in combinatorial auctions, 1 Rassenti, 1982, A combinatorial auction mechanism for airport time slot allocation, Bell J. Economics, 13, 402, 10.2307/3003463 Rothkopf, 1998, Computationally manageable combinatorial auctions, Management Sci., 44, 1131, 10.1287/mnsc.44.8.1131 Russell, 1995 Sandholm, 1993, An implementation of the contract net protocol based on marginal cost calculations, 256 Sandholm, 2000, Issues in computational Vickrey auctions, Internat. J. Electronic Commerce, 4, 107, 10.1080/10864415.2000.11518374 Sandholm, 2002, Algorithm for optimal winner determination in combinatorial auctions, Artificial Intelligence, 135, 1, 10.1016/S0004-3702(01)00159-X Sandholm, 2002, eMediator: A next generation electronic commerce server, Computational Intelligence, 18, 656, 10.1111/1467-8640.t01-1-00209 Sandholm, 2001, CABOB: A fast optimal algorithm for combinatorial auctions, 1102 Sandholm, 2002, Winner determination in combinatorial auction generalizations, 69 Tennenholtz, 2000, Some tractable combinatorial auctions Weiss, 1999