An average-case budget-non-negative double auction protocol
暂无分享,去创建一个
[1] E. H. Clarke. Multipart pricing of public goods , 1971 .
[2] Rajarshi Das,et al. Agent-Human Interactions in the Continuous Double Auction , 2001, IJCAI.
[3] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[4] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[5] Michael P. Wellman,et al. Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..
[6] David C. Parkes,et al. Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges , 2001, IJCAI.
[7] David Levine,et al. CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.
[8] P. Klemperer. Auction Theory: A Guide to the Literature , 1999 .
[9] Hal R. Varian,et al. Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.
[10] John Rust,et al. The Double Auction Market , 1989 .
[11] Makoto Yokoo,et al. Robust double auction protocol against false-name bids , 2001, Proceedings 21st International Conference on Distributed Computing Systems.
[12] R. McAfee,et al. A dominant strategy double auction , 1992 .
[13] Michael P. Wellman,et al. Combinatorial auctions for supply chain formation , 2000, EC '00.
[14] A. Mas-Colell,et al. Microeconomic Theory , 1995 .