Optimal Winner Determination Algorithms

[1]  Yoav Shoham,et al.  Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.

[2]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[3]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

[5]  Dale Schuurmans,et al.  The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming , 2001, IJCAI.

[6]  Martin W. P. Savelsbergh,et al.  Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..

[7]  David C. Parkes,et al.  Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.

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

[9]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[10]  Carlo Mannino,et al.  An exact algorithm for the maximum stable set problem , 1994, Comput. Optim. Appl..

[11]  Vincent Conitzer,et al.  Combinatorial Auctions with Structured Item Graphs , 2004, AAAI.

[12]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[13]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

[14]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[15]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[16]  David Levine,et al.  CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.

[17]  Egon Balas,et al.  Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1992, SIAM J. Comput..

[18]  Panos M. Pardalos,et al.  An algorithm for finding a maximum weighted independent set in an arbitrary graph , 1991, Int. J. Comput. Math..

[19]  Craig Boutilier,et al.  Solving concisely expressed combinatorial auction problems , 2002, AAAI/IAAI.

[20]  Miodrag Potkonjak,et al.  On the sensitivity of incremental algorithms for combinatorial auctions , 2002, Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002).

[21]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[22]  Daniel Lehmann,et al.  Linear Programming helps solving large multi-unit combinatorial auctions , 2002, ArXiv.

[23]  Y. Shoham,et al.  Resource allocation in competitive multiagent systems , 2003 .

[24]  George L. Nemhauser,et al.  The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[25]  Moshe Tennenholtz,et al.  An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.

[26]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[27]  E. Loukakis,et al.  An algorithm for the maximum internally stable set in a weighted graph , 1983 .

[28]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.