Towards truthful mechanisms for binary demand games: a general framework
暂无分享,去创建一个
[1] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[2] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[3] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.
[4] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.
[5] E. H. Clarke. Multipart pricing of public goods , 1971 .
[6] Nikhil R. Devanur,et al. Strategyproof cost-sharing mechanisms for set cover and facility location games , 2005, Decis. Support Syst..
[7] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[8] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[9] Theodore Groves,et al. Incentives in Teams , 1973 .
[10] Xiang-Yang Li,et al. Design multicast protocols for non-cooperative networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[11] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.
[12] Xiang-Yang Li,et al. Truthful low-cost unicast in selfish wireless networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[13] Joan Feigenbaum,et al. A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.
[14] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[15] Xiang-Yang Li,et al. Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.
[16] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[17] Rudolf Müller,et al. On dominant strategy mechanisms , 2003 .
[18] Joan Feigenbaum,et al. Approximation and collusion in multicast cost sharing (extended abstract) , 2001, EC '01.
[19] Alex Zelikovsky,et al. An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.
[20] Paolo Penna,et al. Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines , 2004, STACS.
[21] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[22] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[23] Jerry R. Green,et al. Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods , 1977 .
[24] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[25] Yu Wang,et al. Truthful Multicast in Selfish Wireless Networks , 2004 .
[26] Joan Feigenbaum,et al. Approximation and collusion in multicast cost sharing , 2003, EC '03.