论文信息 - Constrained multi-object auctions and b-matching - 字舞流文

Constrained multi-object auctions and b-matching

Moshe Tennenholtz | Michal Penn | Moshe Tennenholtz | M. Penn

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

[2] Paul R. Milgrom,et al. Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.

[3] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

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

[5] Elmar G. Wolfstetter. AUCTIONS: AN INTRODUCTION , 1996 .

[6] P. Cramton. Money Out of Thin Air: The Nationwide Narrowband PCS Auction , 1995 .

[7] J. Mcmillan. Selling Spectrum Rights , 1994 .

[8] Richard P. Anstee. A Polynomial Algorithm for b-Matchings: An Alternative Approach , 1987, Inf. Process. Lett..

[9] William R. Pulleyblank,et al. Linear Systems for Constrained Matching Problems , 1987, Math. Oper. Res..

[10] R. McAfee,et al. Auctions and Bidding , 1986 .

[11] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .

[12] J. Edmonds,et al. Facets of I-matching polyhedra , 1974 .

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