Chapter 12 The Winner Determination Problem

[1]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[2]  Sven de Vries,et al.  Linear Programming and Vickrey Auctions , 2001 .

[3]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[4]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[5]  Moshe Tennenholtz,et al.  Constrained multi-object auctions and b-matching , 2000, Inf. Process. Lett..

[6]  F. Spieksma.  On the approximability of an interval scheduling problem , 1999 .

[7]  Subhash Suri,et al.  Side constraints and non-price attributes in markets , 2006, Games Econ. Behav..

[8]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[9]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[10]  Noam Nisan,et al.  Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.

[11]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[12]  J. Mark Keil,et al.  On the complexity of scheduling tasks with discrete starting times , 1992, Oper. Res. Lett..

[13]  M. Halld.  Approximations of Independent Sets in Graphs , .

[14]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[15]  Hoong Chuin Lau,et al.  Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring , 1997, J. Graph Algorithms Appl..

[16]  Rudolf Müller,et al.  Optimization in electronic markets: examples in combinatorial auctions , 2001 .

[17]  Robert C. Holte,et al.  Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search , 2001, Canadian Conference on AI.

[18]  Piotr Berman,et al.  On Approximation Properties of the Independent Set Problem for Low Degree Graphs , 1999, Theory of Computing Systems.

[19]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[20]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[21]  Subhash Suri,et al.  Solving combinatorial exchanges: optimality via a few partial bids , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[22]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[23]  Arne Andersson,et al.  Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[24]  Jan Kratochvíl,et al.  Independent Sets with Domination Constraints , 1998, Discret. Appl. Math..

[25]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[26]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[27]  Uriel Feige,et al.  Heuristics for finding large independent sets, with applications to coloring semi-random graphs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).