Expressive negotiation over donations to charities
暂无分享,去创建一个
[1] David C. Parkes,et al. iBundle: an efficient ascending price bundle auction , 1999, EC '99.
[2] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[3] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[4] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[5] K. Arrow. The Property Rights Doctrine and Demand Revelation under Incomplete Information**This work was supported by National Science Foundation under Grant No. SOC75-21820 at the Institute for Mathematical Studies in the Social Sciences, Stanford University. , 1979 .
[6] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[7] Noam Nisan,et al. Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[8] Michael P. Wellman,et al. AkBA: a progressive, anonymous-price combinatorial auction , 2000, EC '00.
[9] E. H. Clarke. Multipart pricing of public goods , 1971 .
[10] Theodore Groves,et al. Incentives in Teams , 1973 .
[11] C. d'Aspremont,et al. Incentives and incomplete information , 1979 .
[12] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[13] Noam Nisan,et al. Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.
[14] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.
[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] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[18] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[19] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[20] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[21] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[22] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[23] Lawrence M. Ausubel,et al. Ascending Auctions with Package Bidding , 2002 .
[24] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .