Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
暂无分享,去创建一个
[1] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[2] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[3] Guido Proietti,et al. A truthful mechanism for the non-utilitarian minimum radius spanning tree problem , 2005, SPAA '05.
[4] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[5] Berthold Vöcking,et al. Approximation techniques for utilitarian mechanism design , 2005, STOC '05.
[6] E. H. Clarke. Multipart pricing of public goods , 1971 .
[7] Theodore Groves,et al. Incentives in Teams , 1973 .
[8] Stephen Gilmore,et al. Flexible Skeletal Programming with eSkel , 2005, Euro-Par.
[9] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[10] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[11] Guido Proietti,et al. Efficient truthful mechanisms for the single‐source shortest paths tree problem , 2005, Concurr. Comput. Pract. Exp..
[12] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[13] Guido Proietti,et al. A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals , 2005, COCOON.
[14] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[15] Cynthia A. Phillips,et al. The network inhibition problem , 1993, STOC.