{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:32Z","timestamp":1750219832182,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2185\/19"],"award-info":[{"award-number":["2185\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BSF","award":["2018206"],"award-info":[{"award-number":["2018206"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2127781"],"award-info":[{"award-number":["2127781"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597810","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"517-535","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fairness and Incentive Compatibility via Percentage Fees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1935-5808","authenticated-orcid":false,"given":"Shahar","family":"Dobzinski","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4271-7291","authenticated-orcid":false,"given":"Sigal","family":"Oren","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6021-679X","authenticated-orcid":false,"given":"Jan","family":"Vondrak","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.4230\/LIPIcs.ITCS.2017.36"},{"key":"e_1_3_2_1_2_1","volume-title":"Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI","author":"Babaioff Moshe","year":"2021","unstructured":"Moshe Babaioff , Tomer Ezra , and Uriel Feige . 2021. 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. AAAI Press , 5119--5126. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/16647 Moshe Babaioff, Tomer Ezra, and Uriel Feige. 2021. 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. AAAI Press, 5119--5126. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/16647"},{"key":"e_1_3_2_1_3_1","volume-title":"28th Annual European Symposium on Algorithms, ESA 2020, September 7--9, 2020, Pisa, Italy (Virtual Conference) (LIPIcs","volume":"17","author":"Barman Siddharth","unstructured":"Siddharth Barman , Umang Bhaskar , Anand Krishna , and Ranjani G. Sundaram . 2020. Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations . In 28th Annual European Symposium on Algorithms, ESA 2020, September 7--9, 2020, Pisa, Italy (Virtual Conference) (LIPIcs , Vol. 173), Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 11:1--11: 17 . Siddharth Barman, Umang Bhaskar, Anand Krishna, and Ranjani G. Sundaram. 2020. Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. In 28th Annual European Symposium on Algorithms, ESA 2020, September 7--9, 2020, Pisa, Italy (Virtual Conference) (LIPIcs, Vol. 173), Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 11:1--11:17."},{"key":"e_1_3_2_1_4_1","volume-title":"Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR abs\/2110.00767","author":"Barman Siddharth","year":"2021","unstructured":"Siddharth Barman , Anand Krishna , Pooja Kulkarni , and Shivika Narang . 2021. Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR abs\/2110.00767 ( 2021 ). arXiv:2110.00767 https:\/\/arxiv.org\/abs\/2110.00767 Siddharth Barman, Anand Krishna, Pooja Kulkarni, and Shivika Narang. 2021. Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR abs\/2110.00767 (2021). arXiv:2110.00767 https:\/\/arxiv.org\/abs\/2110.00767"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3219166.3219176"},{"doi-asserted-by":"crossref","unstructured":"Dave Buchfuhrer Shaddin Dughmi Hu Fu Robert Kleinberg Elchanan Mossel Christos Papadimitriou Michael Schapira Yaron Singer and Chris Umans. 2010. Inapproximability for VCG-Based Combinatorial Auctions. In ACM-SIAM SODA. 518--536.  Dave Buchfuhrer Shaddin Dughmi Hu Fu Robert Kleinberg Elchanan Mossel Christos Papadimitriou Michael Schapira Yaron Singer and Chris Umans. 2010. Inapproximability for VCG-Based Combinatorial Auctions. In ACM-SIAM SODA. 518--536.","key":"e_1_3_2_1_6_1","DOI":"10.1137\/1.9781611973075.45"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1086\/664613"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_1_9_1","volume-title":"Multipart Pricing of Public Goods. Public Choice","author":"Clarke E. H.","year":"1971","unstructured":"E. H. Clarke . 1971. Multipart Pricing of Public Goods. Public Choice ( 1971 ), 17--33. E. H. Clarke. 1971. Multipart Pricing of Public Goods. Public Choice (1971), 17--33."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/978-3-642-25510-6_9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/2746539.2746589"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the fourteenth ACM conference on Electronic commerce. 251--268","author":"Cole Richard","year":"2013","unstructured":"Richard Cole , Vasilis Gkatzelis , and Gagan Goel . 2013 . Mechanism design for fair division: allocating divisible items without payments . In Proceedings of the fourteenth ACM conference on Electronic commerce. 251--268 . Richard Cole, Vasilis Gkatzelis, and Gagan Goel. 2013. Mechanism design for fair division: allocating divisible items without payments. In Proceedings of the fourteenth ACM conference on Electronic commerce. 251--268."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/2746539.2746597"},{"doi-asserted-by":"crossref","unstructured":"Shahar Dobzinski. 2007. Two Randomized Mechanisms for Combinatorial Auctions. In APPROX. 89--103.  Shahar Dobzinski. 2007. Two Randomized Mechanisms for Combinatorial Auctions. In APPROX. 89--103.","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-540-74208-1_7"},{"doi-asserted-by":"crossref","unstructured":"Shahar Dobzinski. 2011. An Impossibility Result for Truthful Combinatorial Auctions with Submodular Valuations. In STOC. 139--148.  Shahar Dobzinski. 2011. An Impossibility Result for Truthful Combinatorial Auctions with Submodular Valuations. In STOC. 139--148.","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1993636.1993656"},{"doi-asserted-by":"crossref","unstructured":"Shahar Dobzinski and Noam Nisan. 2007. Limitations of VCG-Based Mechanisms. In STOC. 338--344.  Shahar Dobzinski and Noam Nisan. 2007. Limitations of VCG-Based Mechanisms. In STOC. 338--344.","key":"e_1_3_2_1_16_1","DOI":"10.1145\/1250790.1250842"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/1861751.1861754"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1287\/moor.1090.0436"},{"doi-asserted-by":"crossref","unstructured":"Shahar Dobzinski and Jan Vondr\u00e1k. 2012. The computational complexity of truthfulness in combinatorial auctions. In EC. 405--422.  Shahar Dobzinski and Jan Vondr\u00e1k. 2012. The computational complexity of truthfulness in combinatorial auctions. In EC. 405--422.","key":"e_1_3_2_1_19_1","DOI":"10.1145\/2229012.2229044"},{"doi-asserted-by":"crossref","unstructured":"Shaddin Dughmi and Jan Vondr\u00e1k. 2011. Limitations of randomized mechanisms for combinatorial auctions. In FOCS. 502--511.  Shaddin Dughmi and Jan Vondr\u00e1k. 2011. Limitations of randomized mechanisms for combinatorial auctions. In FOCS. 502--511.","key":"e_1_3_2_1_20_1","DOI":"10.1109\/FOCS.2011.64"},{"key":"e_1_3_2_1_21_1","volume-title":"Approximating Nash Social Welfare by Matching and Local Search. STOC","author":"Garg Jugal","year":"2023","unstructured":"Jugal Garg , Edin Husic , Wenzheng Li , L\u00e1szl\u00f3 A. V\u00e9gh , and Jan Vondr\u00e1k . 2023. Approximating Nash Social Welfare by Matching and Local Search. STOC ( 2023 ). Jugal Garg, Edin Husic, Wenzheng Li, L\u00e1szl\u00f3 A. V\u00e9gh, and Jan Vondr\u00e1k. 2023. Approximating Nash Social Welfare by Matching and Local Search. STOC (2023)."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms. SIAM, 2673--2687","author":"Garg Jugal","year":"2020","unstructured":"Jugal Garg , Pooja Kulkarni , and Rucha Kulkarni . 2020 . Approximating Nash social welfare under submodular valuations through (un) matchings . In Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms. SIAM, 2673--2687 . Jugal Garg, Pooja Kulkarni, and Rucha Kulkarni. 2020. Approximating Nash social welfare under submodular valuations through (un) matchings. In Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms. SIAM, 2673--2687."},{"key":"e_1_3_2_1_23_1","volume-title":"Incentives in teams. Econometrica","author":"Groves T.","year":"1973","unstructured":"T. Groves . 1973. Incentives in teams. Econometrica ( 1973 ), 617--631. T. Groves. 1973. Incentives in teams. Econometrica (1973), 617--631."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1086\/261158"},{"key":"e_1_3_2_1_25_1","volume-title":"2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 25--36","author":"Li Wenzheng","year":"2022","unstructured":"Wenzheng Li and Jan Vondr\u00e1k . 2022 . A constant-factor approximation algorithm for Nash social welfare with submodular valuations . In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 25--36 . Wenzheng Li and Jan Vondr\u00e1k. 2022. A constant-factor approximation algorithm for Nash social welfare with submodular valuations. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 25--36."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1287\/moor.6.1.58"},{"volume-title":"Aggregation and Revelation of Preferences. Papers presented at the first European Summer Workshop of the","author":"Roberts Kevin","unstructured":"Kevin Roberts . 1979. The characterization of implementable choice rules . In Aggregation and Revelation of Preferences. Papers presented at the first European Summer Workshop of the Economic Society , Jean- Jacques Laffont (Ed.). North-Holland, 321--349. Kevin Roberts. 1979. The characterization of implementable choice rules. In Aggregation and Revelation of Preferences. Papers presented at the first European Summer Workshop of the Economic Society, Jean-Jacques Laffont (Ed.). North-Holland, 321--349.","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","volume-title":"Auctions and Competitive Sealed Tenders. Journal of Finance","author":"Vickrey W.","year":"1961","unstructured":"W. Vickrey . 1961. Counterspeculation , Auctions and Competitive Sealed Tenders. Journal of Finance ( 1961 ), 8--37. W. Vickrey. 1961. Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance (1961), 8--37."}],"event":{"sponsor":["SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC '23","name":"EC '23: 24th ACM Conference on Economics and Computation","location":"London United Kingdom"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597810","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:34Z","timestamp":1750178794000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":28,"alternative-id":["10.1145\/3580507.3597810","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597810","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}