Fairness and Incentive Compatibility via Percentage Fees (2402.14173v1)
Abstract: We study incentive-compatible mechanisms that maximize the Nash Social Welfare. Since traditional incentive-compatible mechanisms cannot maximize the Nash Social Welfare even approximately, we propose changing the traditional model. Inspired by a widely used charging method (e.g., royalties, a lawyer that charges some percentage of possible future compensation), we suggest charging the players some percentage of their value of the outcome. We call this model the \emph{percentage fee} model. We show that there is a mechanism that maximizes exactly the Nash Social Welfare in every setting with non-negative valuations. Moreover, we prove an analog of Roberts theorem that essentially says that if the valuations are non-negative, then the only implementable social choice functions are those that maximize weighted variants of the Nash Social Welfare. We develop polynomial time incentive compatible approximation algorithms for the Nash Social Welfare with subadditive valuations and prove some hardness results.
- Nash social welfare, matrix permanent, and stable polynomials. In Christos H. Papadimitriou, editor, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, volume 67 of LIPIcs, pages 36:1–36:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
- Fair and truthful mechanisms for dichotomous valuations. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pages 5119–5126. AAAI Press, 2021.
- Tight approximation algorithms for p-mean welfare under subadditive valuations. In Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors, 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), volume 173 of LIPIcs, pages 11:1–11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
- Sublinear approximation algorithm for nash social welfare with XOS valuations. CoRR, abs/2110.00767, 2021.
- Finding fair and efficient allocations. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 557–574, 2018.
- Inapproximability for VCG-based combinatorial auctions. In ACM-SIAM SODA, pages 518–536, 2010.
- Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061–1103, 2011.
- The unreasonable fairness of maximum nash welfare. ACM Transactions on Economics and Computation (TEAC), 7(3):1–32, 2019.
- E. H. Clarke. Multipart pricing of public goods. Public Choice, pages 17–33, 1971.
- Truth, envy, and truthful market clearing bundle pricing. In Ning Chen, Edith Elkind, and Elias Koutsoupias, editors, Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings, volume 7090 of Lecture Notes in Computer Science, pages 97–108. Springer, 2011.
- Approximating the nash social welfare with indivisible items. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 371–380, 2015.
- Mechanism design for fair division: allocating divisible items without payments. In Proceedings of the fourteenth ACM conference on Electronic commerce, pages 251–268, 2013.
- Inapproximability of truthful mechanisms via generalizations of the vc dimension. In Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, pages 401–408, 2015.
- Implementation with contingent contracts. Econometrica, 82(6):2371–2393, 2014.
- Shahar Dobzinski. Two randomized mechanisms for combinatorial auctions. In APPROX, pages 89–103, 2007.
- Shahar Dobzinski. An impossibility result for truthful combinatorial auctions with submodular valuations. In STOC, pages 139–148, 2011.
- Limitations of VCG-based mechanisms. In STOC, pages 338–344, 2007.
- Mechanisms for multi-unit auctions. Journal of Artificial Intelligence Research, 37:85–98, 2010.
- Approximation algorithms for combinatorial auctions with complement-free bidders. Math. Oper. Res., 35(1):1–13, 2010.
- The computational complexity of truthfulness in combinatorial auctions. In EC, pages 405–422, 2012.
- Limitations of randomized mechanisms for combinatorial auctions. In FOCS, pages 502–511, 2011.
- Approximating nash social welfare by matching and local search. STOC, 2023.
- Approximating nash social welfare under submodular valuations through (un) matchings. In Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, pages 2673–2687. SIAM, 2020.
- T. Groves. Incentives in teams. Econometrica, pages 617–631, 1973.
- Robert G Hansen. Auctions with contingent payments. The American Economic Review, 75(4):862–865, 1985.
- Herman B Leonard. Elicitation of honest preferences for the assignment of individuals to positions. Journal of political Economy, 91(3):461–479, 1983.
- A constant-factor approximation algorithm for nash social welfare with submodular valuations. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 25–36. IEEE, 2022.
- R. B. Myerson. Optimal auction design. Mathematics of Operations Research, 6(1):58–73, 1981.
- Kevin Roberts. The characterization of implementable choice rules. In Jean-Jacques Laffont, editor, Aggregation and Revelation of Preferences. Papers presented at the first European Summer Workshop of the Economic Society, pages 321–349. North-Holland, 1979.
- Andrzej Skrzypacz. Auctions with contingent payments?an overview. International Journal of Industrial Organization, 31(5):666–675, 2013.
- Joseph E Stiglitz. Incentives and risk sharing in sharecropping. The Review of Economic Studies, 41(2):219–255, 1974.
- W. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, pages 8–37, 1961.