Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges
暂无分享,去创建一个
[1] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[2] Michael P. Wellman,et al. Combinatorial auctions for supply chain formation , 2000, EC '00.
[3] Michael P. Wellman,et al. Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..
[4] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[5] Ho Soo Lee,et al. Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand , 2001, Electron. Commer. Res..
[6] E. H. Clarke. Multipart pricing of public goods , 1971 .
[7] R. McAfee,et al. A dominant strategy double auction , 1992 .
[8] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[9] Theodore Groves,et al. Incentives in Teams , 1973 .
[10] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[11] Jeffrey K. MacKie-Mason,et al. Generalized Vickrey Auctions , 1994 .
[12] M. Jackson,et al. Strategy-Proof Exchange , 1995 .