Using Nash Implementation to Achieve Better Frugality Ratios
暂无分享,去创建一个
Ming-Yang Kao | Xiang-Yang Li | Weizhao Wang | Chien-Chung Huang | M. Kao | Xiangyang Li | Chien-Chung Huang | Weizhao Wang
[1] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.
[2] Éva Tardos,et al. Frugal path mechanisms , 2002, SODA '02.
[3] Anna R. Karlin,et al. Beyond VCG: frugality of truthful mechanisms , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[4] E. H. Clarke. Multipart pricing of public goods , 1971 .
[5] Theodore Groves,et al. Incentives in Teams , 1973 .
[6] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[7] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[8] Paolo Penna,et al. Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines , 2004, STACS.
[9] Nicole Immorlica,et al. First-price path auctions , 2005, EC '05.
[10] Kunal Talwar,et al. The Price of Truth: Frugality in Truthful Mechanisms , 2003, STACS.
[11] Nicole Immorlica,et al. Computing with strategic agents , 2005 .
[12] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[13] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[14] Xiang-Yang Li,et al. Towards truthful mechanisms for binary demand games: a general framework , 2005, EC '05.