Constrained multi-object auctions and b-matching

Information Processing Letters

Volumn 75, Issue 1, 2000, Pages 29-34

  Penn, Michal ^a   Tennenholtz, Moshe ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DISTRIBUTION OF GOODS; POLYNOMIALS; PROBLEM SOLVING;

AUCTIONS;

ELECTRONIC COMMERCE;

EID: 0034225659     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00073-9     Document Type: Article

References (14)

1. Anstee R.P. A polynomial algorithm for b -matching: An alternative approach. Inform. Process. Lett. Vol. 24:1987;153-157.
2. Cook S.A. The complexity of theorem-proving procedures. Proc. 3rd Ann. ACM Symp. on Theory of Computing. 1971;151-158 ACM, New York.
3. Cook W., Pulleyblank W.R. Linear systems for constrained matching problems. Math. Oper. Res. Vol. 12:1987;97-120.
4. Cramton P.C. Money out of thin air: The nationwide narrowband pcs auction. J. Econom. Management Strategy. 1995.
5. Cunningham W.H., March III A.B. A primal algorithm for optimum matching. Math. Programming Study. Vol. 8:1978;50-72.
6. Fujishima Y., Leyton-Brown K., Shoham Y. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. Proc. IJCAI-99, Stockholm, Sweden. 1999.
7. McAfee R.P., McMillan J. Auctions and bidding. J. Econom. Literature. Vol. 25:1987;699-738.
8. McMillan J. Selling spectrum rights. J. Econom. Perspectives. Vol. 8:1994;145-162.
9. Milgrom P. Putting auction theory to work: The simultaneous ascending auction. Technical Report 98-0002:1998;Department of Economics, Stanford University.
10. Milgrom P.R. Auction theory. Bewly T. Advances in Economic Theory: Fifth World Congress. 1987;Cambridge University Press.
11. Pulleyblank W.R. Facets of matching polyhedra. Ph.D. Thesis:1973;University of Waterloo, Department of Combinatorial Optimization, Waterloo, Ontario.
12. Rothkhof M.H., Pekec A., Harstad R.M. Computationally manageable combinatorial auctions. Management Sci. Vol. 44:(8):1998;1131-1147.
13. Sandholm T. An algorithm for optimal winner determination in combinatorial auctions. Proc. IJCAI-99, Stockholm, Sweden. 1999.
14. Wolfstetter E. Auctions: An introduction. J. Econom. Surveys. Vol. 10:(4):1996;367-420.