Robust double auction protocol against false-name bids
暂无分享,去创建一个
[1] T. Sandholm. Limitations of the Vickrey Auction in Computational Multiagent Systems , 1996 .
[2] Makoto Yokoo,et al. A Limitation of the Generalized Vickrey Auction in Electronic Commerce: Robustness against False-name Bids , 1999, AAAI/IAAI.
[3] Eric Bennett Rasmusen. Readings in games and information , 2001 .
[4] Makoto Yokoo,et al. Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.
[5] Makoto Yokoo,et al. The effect of false-name declarations in mechanism design: towards collective decision making on the Internet , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.
[6] Hal R. Varian,et al. Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.
[7] 櫻井 祐子,et al. Hal R. Varian: Economic Mechanism Design for Computerized Agents, the First Usenix Workshop on Electronic Commercr (1995). , 2000 .
[8] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[9] R. McAfee,et al. A dominant strategy double auction , 1992 .
[10] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[11] Michael P. Wellman,et al. The Michigan Internet AuctionBot: a configurable auction server for human and software agents , 1998, AGENTS '98.
[12] Pattie Maes,et al. Agent-mediated Electronic Commerce : A Survey , 1998 .
[13] P. Klemperer. Auction Theory: A Guide to the Literature , 1999 .
[14] Michael P. Wellman,et al. Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..
[15] A. Mas-Colell,et al. Microeconomic Theory , 1995 .