Truthfulness on a budget: trading money for approximation through monitoring
暂无分享,去创建一个
[1] Michal Feldman,et al. Mechanism design on discrete lines and cycles , 2012, EC '12.
[2] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[3] Ning Chen,et al. Mechanism Design without Money via Stable Matching , 2011, ArXiv.
[4] Minming Li,et al. Facility Location Games with Dual Preference , 2015, AAMAS.
[5] Carmine Ventre,et al. O PTIMAL COLLUSION-RESISTANT MECHANISMS WITH VERIFICATION ∗ , 2007 .
[6] Ioannis Caragiannis,et al. The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users , 2018, EC.
[7] Ioannis Caragiannis,et al. Efficiency and Complexity of Price Competition Among Single-Product Vendors , 2015, IJCAI.
[8] Ning Chen,et al. Worst-Case Mechanism Design via Bayesian Analysis , 2017, SIAM J. Comput..
[9] Edith Elkind,et al. Frugality ratios and improved truthful mechanisms for vertex cover , 2006, EC '07.
[10] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[11] Carmine Ventre,et al. What to Verify for Optimal Truthful Mechanisms without Money , 2016, AAMAS.
[12] Carmine Ventre,et al. Mechanism Design for Constrained Heterogeneous Facility Location , 2019, SAGT.
[13] Yuan Zhou,et al. Tighter Bounds for Facility Games , 2009, WINE.
[14] Evangelos Markakis,et al. On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives , 2017, WINE.
[15] Gruia Calinescu. Bounding the payment of approximate truthful mechanisms , 2015, Theor. Comput. Sci..
[16] Ariel D. Procaccia,et al. Algorithms for strategyproof classification , 2012, Artif. Intell..
[17] Moshe Tennenholtz,et al. Approximate mechanism design without money , 2009, EC '09.
[18] Joseph Naor,et al. Non-Cooperative Cost Sharing Games via Subsidies , 2009, Theory of Computing Systems.
[19] Carmine Ventre,et al. Heterogeneous facility location without money , 2016, Theor. Comput. Sci..
[20] Elias Koutsoupias,et al. The Anarchy of Scheduling Without Money , 2016, SAGT.
[21] Pooya Jalaly,et al. Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations , 2018, WINE.
[22] Anna R. Karlin,et al. Beyond VCG: frugality of truthful mechanisms , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[23] Yukun Cheng,et al. Strategy-proof approximation mechanisms for an obnoxious facility game on networks , 2013, Theor. Comput. Sci..
[24] Noga Alon,et al. Strategyproof Approximation of the Minimax on Networks , 2010, Math. Oper. Res..
[25] John Augustine,et al. Enforcing Efficient Equilibria in Network Design Games via Subsidies , 2011, SPAA '12.
[26] Eleftherios Anastasiadis,et al. Heterogeneous Facility Location Games , 2018, AAMAS.
[27] Matthias Messner,et al. Extremal Incentive Compatible Transfers , 2008, J. Econ. Theory.
[28] Christos Tzamos,et al. On the Power of Deterministic Mechanisms for Facility Location Games , 2014, TEAC.
[29] Guido Schäfer,et al. Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online , 2019, EC.
[30] Moshe Tennenholtz,et al. Mechanism Design with Strategic Mediators , 2015, TEAC.
[31] Christos H. Papadimitriou,et al. Mechanisms for complement-free procurement , 2011, EC '11.
[32] Zeyuan Allen Zhu,et al. Asymptotically optimal strategy-proof mechanisms for two-facility games , 2010, EC '10.
[33] Ning Chen,et al. Budget feasible mechanism design: from prior-free to bayesian , 2012, STOC '12.
[34] Yu Cheng,et al. A Simple Mechanism for a Budget-Constrained Buyer , 2018, WINE.
[35] H. Moulin. On strategy-proofness and single peakedness , 1980 .
[36] Yukun Cheng,et al. Mechanisms for Obnoxious Facility Game on a Path , 2011, COCOA.
[37] Carmine Ventre,et al. Optimal collusion-resistant mechanisms with verification , 2009, EC '09.
[38] Ning Chen,et al. Frugal Mechanism Design via Spectral Techniques , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[39] Carmine Ventre,et al. Heterogeneous Facility Location without Money on the Line , 2014, ECAI.
[40] Christos Tzamos,et al. Truthful Facility Location with Additive Errors , 2017, ArXiv.
[41] Rakesh V. Vohra,et al. Strategy-proof Location on a Network , 2002, J. Econ. Theory.
[42] Kenneth Steiglitz,et al. Frugality in path auctions , 2004, SODA '04.
[43] Kunal Talwar,et al. The Price of Truth: Frugality in Truthful Mechanisms , 2003, STACS.
[44] Annamária Kovács,et al. Mechanisms with Monitoring for Truthful RAM Allocation , 2015, WINE.
[45] Yaron Singer,et al. Budget Feasible Mechanisms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[46] Nick Gravin,et al. Optimal Budget-Feasible Mechanisms for Additive Valuations , 2019, EC.
[47] Cristopher Moore,et al. Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[48] Carmine Ventre,et al. Truthful Mechanisms without Money for Non-Utilitarian Heterogeneous Facility Location , 2015, AAAI.
[49] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[50] Hiroshi Nagamochi,et al. Characterizing Mechanisms in Obnoxious Facility Game , 2012, COCOA.
[51] Mohammad Taghi Hajiaghayi,et al. Frugal Auction Design for Set Systems: Vertex Cover and Knapsack , 2018, EC.
[52] Elias Koutsoupias,et al. Scheduling Without Payments , 2011, Theory of Computing Systems.