Auctions with Budget Constraints
暂无分享,去创建一个
[1] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[2] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[3] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.
[4] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[6] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[7] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[8] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[9] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[10] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[11] Moshe Tennenholtz,et al. Tractable combinatorial auctions and b-matching , 2002, Artif. Intell..
[12] Bidding clubs in first-price auctions , 2002, AAAI/IAAI.
[13] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions , 2008, Games Econ. Behav..
[14] Anna R. Karlin,et al. Truthful and Competitive Double Auctions , 2002, ESA.
[15] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[16] Amos Fiat,et al. Competitive generalized auctions , 2002, STOC '02.
[17] Andrew V. Goldberg,et al. Competitiveness via consensus , 2003, SODA '03.
[18] Noam Nisan,et al. Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.
[19] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.