{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:59Z","timestamp":1778495159590,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:00:00Z","timestamp":1656979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:00:00Z","timestamp":1656979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10107-022-01855-y","type":"journal-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T12:03:08Z","timestamp":1657022588000},"page":"319-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Approximate and strategyproof maximin share allocation of chores with ordinal preferences"],"prefix":"10.1007","volume":"203","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-2115","authenticated-orcid":false,"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"1855_CR1","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: On truthful mechanisms for maximin share allocations. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pp. 31\u201337. IJCAI\/AAAI Press (2016). URL http:\/\/www.ijcai.org\/Abstract\/16\/012"},{"issue":"4","key":"1855_CR2","doi-asserted-by":"publisher","first-page":"52:1","DOI":"10.1145\/3147173","volume":"13","author":"G Amanatidis","year":"2017","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms 13(4), 52:1-52:28 (2017). https:\/\/doi.org\/10.1145\/3147173","journal-title":"ACM Trans. Algorithms"},{"key":"1855_CR3","doi-asserted-by":"publisher","unstructured":"Amanatidis, G., Birmpas, G., Markakis, V.: Comparing approximate relaxations of envy-freeness. In: Lang, J., (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, pp. 42\u201348. Stockholm, Sweden (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/6","DOI":"10.24963\/ijcai.2018\/6"},{"issue":"1","key":"1855_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/2994501.2994504","volume":"15","author":"E Anshelevich","year":"2016","unstructured":"Anshelevich, E.: Ordinal approximation in matching and social choice. SIGecom Exch. 15(1), 60\u201364 (2016). https:\/\/doi.org\/10.1145\/2994501.2994504","journal-title":"SIGecom Exch."},{"key":"1855_CR5","unstructured":"Anshelevich, E., Sekar, S.: Blind, greedy, and random: Algorithms for matching and clustering using only ordinal information. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, pp. 390\u2013396. AAAI Press, Phoenix, Arizona, USA (2016). URL http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12099"},{"key":"1855_CR6","doi-asserted-by":"publisher","unstructured":"Anshelevich, E., Sekar, S.: Truthful mechanisms for matching and clustering in an ordinal world. In: Cai, Y., Vetta, A. (eds.) Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11-14, 2016, Proceedings, volume 10123 of Lecture Notes in Computer Science, pp. 265\u2013278. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_19","DOI":"10.1007\/978-3-662-54110-4_19"},{"key":"1855_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1109\/FOCS.2016.52","volume-title":"IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency","author":"H Aziz","year":"2016","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: Dinur, I. (ed.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, pp. 416\u2013427. IEEE Computer Society, New Brunswick, New Jersey, USA (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.52"},{"key":"1855_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.artint.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Walsh, T.: Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227, 71\u201392 (2015). https:\/\/doi.org\/10.1016\/j.artint.2015.06.002","journal-title":"Artif. Intell."},{"key":"1855_CR9","unstructured":"Aziz, H., Filos-Ratsikas, A., Chen, J., Mackenzie, S., Mattei, N: Egalitarianism of random assignment mechanisms: (extended abstract). In: Jonker, C.M., Marsella, S., Thangarajah, J., Tuyls, K., (eds.) Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016, pp. 1267\u20131268. ACM (2016). URL http:\/\/dl.acm.org\/citation.cfm?id=2937113"},{"key":"1855_CR10","doi-asserted-by":"publisher","unstructured":"Aziz, H., Kalinowski, T., Walsh, T., Xia, L.: Welfare of sequential allocation mechanisms for indivisible goods. In: Kaminka, G.A., Fox, M., Bouquet, P., H\u00fcllermeier, E., Dignum, V., Dignum, F., van Harmelen, F. (eds.) ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), volume 285 of Frontiers in Artificial Intelligence and Applications, pp. 787\u2013794. IOS Press (2016). https:\/\/doi.org\/10.3233\/978-1-61499-672-9-787","DOI":"10.3233\/978-1-61499-672-9-787"},{"key":"1855_CR11","unstructured":"Aziz, H., Bouveret, S., Lang, J., Mackenzie, S.: Complexity of manipulating sequential allocation. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pp. 328\u2013334. AAAI Press (2017). URL http:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14623"},{"key":"1855_CR12","doi-asserted-by":"publisher","unstructured":"Aziz, H., Goldberg, P., Walsh, T.: Equilibria in sequential allocation. In: Rothe, J. (ed.) Algorithmic Decision Theory - 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25-27, 2017, Proceedings, volume 10576 of Lecture Notes in Computer Science, pp. 270\u2013283. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-67504-6_19","DOI":"10.1007\/978-3-319-67504-6_19"},{"key":"1855_CR13","unstructured":"Aziz, H., Rauchecker, G., Schryen, G., Walsh, T.: Algorithms for max-min share fair allocation of indivisible chores. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pp. 335\u2013341. AAAI Press (2017). URL http:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14606"},{"key":"1855_CR14","doi-asserted-by":"publisher","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp. 53\u201359 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/8","DOI":"10.24963\/ijcai.2019\/8"},{"key":"1855_CR15","doi-asserted-by":"publisher","unstructured":"Aziz, H., Chan, H., Li, B.: Weighted maxmin fair share allocation of indivisible chores. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp. 46\u201352 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/7","DOI":"10.24963\/ijcai.2019\/7"},{"key":"1855_CR16","doi-asserted-by":"publisher","unstructured":"Aziz, H., Li, B., Wu, X.: Strategyproof and approximately maxmin fair share allocation of chores. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp. 60\u201366 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/9","DOI":"10.24963\/ijcai.2019\/9"},{"key":"1855_CR17","unstructured":"Balinski, M., Young, H.P.: Fair Representation: Meeting the Ideal of One Man, One Vote, 2nd edn. Brookings Institution Press (2001)"},{"key":"1855_CR18","doi-asserted-by":"publisher","unstructured":"Barman, S., Krishnamurthy, S.K.: Approximation algorithms for maximin fair division. ACM Trans. Economics and Comput. 8(1), 5:1-5:28 (2020). https:\/\/doi.org\/10.1145\/3381525","DOI":"10.1145\/3381525"},{"key":"1855_CR19","doi-asserted-by":"publisher","unstructured":"Bei, X., Chen, N., Huzhang, G., Tao, B., Wu, J.: Cake cutting: Envy and truth. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 3625\u20133631 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/507","DOI":"10.24963\/ijcai.2017\/507"},{"key":"1855_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.artint.2015.06.003","volume":"227","author":"Craig Boutilier","year":"2015","unstructured":"Boutilier, Craig, Caragiannis, Ioannis, Haber, Simi, Tyler, Lu., Procaccia, Ariel D., Sheffet, Or.: Optimal social choice functions: A utilitarian view. Artif. Intell. 227, 190\u2013213 (2015). https:\/\/doi.org\/10.1016\/j.artint.2015.06.003","journal-title":"Artif. Intell."},{"key":"1855_CR21","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Lang, J.: Manipulating picking sequences. In: Schaub, T., Friedrich, G., O\u2019Sullivan, B. (eds.) ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014), volume 263 of Frontiers in Artificial Intelligence and Applications, pp. 141\u2013146. IOS Press (2014). https:\/\/doi.org\/10.3233\/978-1-61499-419-0-141","DOI":"10.3233\/978-1-61499-419-0-141"},{"issue":"2","key":"1855_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"Sylvain Bouveret","year":"2016","unstructured":"Bouveret, Sylvain, Lema\u00eetre, Michel: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi Agent Syst. 30(2), 259\u2013290 (2016). https:\/\/doi.org\/10.1007\/s10458-015-9287-3","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"1855_CR23","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Endriss, U., Lang, J.: Fair division under ordinal preferences: Computing envy-free allocations of indivisible goods. In: Coelho, H., Studer, R., Wooldridge, M.J. (eds.) ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings, volume 215 of Frontiers in Artificial Intelligence and Applications, pp. 387\u2013392. IOS Press (2010). https:\/\/doi.org\/10.3233\/978-1-60750-606-5-387","DOI":"10.3233\/978-1-60750-606-5-387"},{"key":"1855_CR24","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair allocation of indivisible goods. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 284\u2013310. Cambridge University Press, Cambridge, England (2016). https:\/\/doi.org\/10.1017\/CBO9781107446984.013","DOI":"10.1017\/CBO9781107446984.013"},{"key":"1855_CR25","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division - From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge, England (1996)","DOI":"10.1017\/CBO9780511598975"},{"issue":"6","key":"1855_CR26","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"Eric Budish","year":"2011","unstructured":"Budish, Eric: The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. of Political Econ. 119(6), 1061\u20131103 (2011). https:\/\/doi.org\/10.1086\/664613","journal-title":"J. of Political Econ."},{"key":"1855_CR27","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On low-envy truthful allocations. In: Rossi, F., Tsouki\u00e0s, A. (eds.) Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings, volume 5783 of Lecture Notes in Computer Science, pp. 111\u2013119. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_10","DOI":"10.1007\/978-3-642-04428-1_10"},{"key":"1855_CR28","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1613\/jair.5282","volume":"58","author":"Ioannis Caragiannis","year":"2017","unstructured":"Caragiannis, Ioannis, Nath, Swaprava, Procaccia, Ariel D., Shah, Nisarg: Subset selection via implicit utilitarian voting. J. Artif. Intell. Res. 58, 123\u2013152 (2017). https:\/\/doi.org\/10.1613\/jair.5282","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"1855_CR29","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. ACM Trans. Economics and Comput. 7(3), 12:1-12:32 (2019). https:\/\/doi.org\/10.1145\/3355902","journal-title":"ACM Trans. Economics and Comput."},{"issue":"1","key":"1855_CR30","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Yiling Chen","year":"2013","unstructured":"Chen, Yiling, Lai, John K., Parkes, David C., Procaccia, Ariel D.: Truth, justice, and cake cutting. Games Econ. Behav. 77(1), 284\u2013297 (2013). https:\/\/doi.org\/10.1016\/j.geb.2012.10.009","journal-title":"Games Econ. Behav."},{"key":"1855_CR31","doi-asserted-by":"publisher","unstructured":"Cole, R., Gkatzelis, V., Goel, G.: Mechanism design for fair division: Allocating divisible items without payments. In: Kearns, M.J., McAfee, R.P., Tardos, \u00c9. (eds.) Proceedings of the fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, June 16-20, 2013, pp. 251\u2013268. ACM (2013). https:\/\/doi.org\/10.1145\/2492002.2482582","DOI":"10.1145\/2492002.2482582"},{"key":"1855_CR32","unstructured":"Feige, U., Sapir, A., Tauber, L.: A tight negative example for MMS fair allocations. In: Proceedings of the 17th Conference on Web and Internet Economics, WINE 2021, 4-17 December, 2021, Potsdam, Germany (2021)"},{"key":"1855_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103547","volume":"300","author":"J Garg","year":"2021","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. Artif. Intell. 300, 103547 (2021). https:\/\/doi.org\/10.1016\/j.artint.2021.103547","journal-title":"Artif. Intell."},{"key":"1855_CR34","doi-asserted-by":"publisher","unstructured":"Garg, J., McGlaughlin, P., Taki, S: Approximating maximin share allocations. In: Fineman, J.T., Mitzenmacher, M. (eds.) 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, volume\u00a069 of OASICS, pp. 20:1\u201320:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.20","DOI":"10.4230\/OASIcs.SOSA.2019.20"},{"key":"1855_CR35","doi-asserted-by":"publisher","unstructured":"Ghodsi, M., Hajiaghayi, M.T. Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: Improvements and generalizations. In: Tardos, \u00c9., Elkind, E., Vohra, R. (eds.) Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018, pp. 539\u2013556. ACM (2018). https:\/\/doi.org\/10.1145\/3219166.3219238","DOI":"10.1145\/3219166.3219238"},{"key":"1855_CR36","doi-asserted-by":"publisher","unstructured":"Halpern, D., Shah, N.: Fair and efficient resource allocation with partial information. In: Zhou, Z.-H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event \/ Montreal, Canada, 19-27 August 2021, pp. 224\u2013230 (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/32","DOI":"10.24963\/ijcai.2021\/32"},{"key":"1855_CR37","doi-asserted-by":"publisher","unstructured":"Huang, X., Lu, P.: An algorithmic framework for approximating maximin share allocation of chores. In: Bir\u00f3, P., Chawla, S., Echenique, F. (eds.) EC \u201921: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021, pp. 630\u2013631. ACM (2021). https:\/\/doi.org\/10.1145\/3465456.3467555","DOI":"10.1145\/3465456.3467555"},{"issue":"2","key":"1855_CR38","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/opre.19.2.270","volume":"19","author":"DA Kohler","year":"1971","unstructured":"Kohler, D.A., Chandrasekaran, R.: A class of sequential games. Oper. Res. 19(2), 270\u2013277 (1971). https:\/\/doi.org\/10.1287\/opre.19.2.270","journal-title":"Oper. Res."},{"key":"1855_CR39","doi-asserted-by":"publisher","unstructured":"Kulkarni, R., Mehta, R., Taki, S.: Indivisible mixed manna: On the computability of MMS+PO allocations. In: Bir\u00f3, P., Chawla, S., Echenique, F. (eds.) EC \u201921: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021, pp. 683\u2013684. ACM (2021). https:\/\/doi.org\/10.1145\/3465456.3467553","DOI":"10.1145\/3465456.3467553"},{"issue":"2","key":"1855_CR40","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3140756","volume":"65","author":"D Kurokawa","year":"2018","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: Guaranteeing approximate maximin shares. J. ACM 65(2), 8:1-8:27 (2018). https:\/\/doi.org\/10.1145\/3140756","journal-title":"J. ACM"},{"key":"1855_CR41","doi-asserted-by":"crossref","unstructured":"Li, B., Li, Y., Wu, X.: Almost proportional allocations for indivisible chores. CoRR, abs\/2103.11849 (2021)","DOI":"10.1145\/3485447.3512057"},{"key":"1855_CR42","doi-asserted-by":"publisher","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Breese, J.S., Feigenbaum, J., Seltzer, M.I. (eds.) Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, May 17-20, 2004, pp. 125\u2013131. ACM (2004). https:\/\/doi.org\/10.1145\/988772.988792","DOI":"10.1145\/988772.988792"},{"key":"1855_CR43","doi-asserted-by":"publisher","unstructured":"Mandal, D., Shah, N., Woodruff, D.P.: Optimal communication-distortion tradeoff in voting. In: Bir\u00f3, P., Hartline, J.D., Ostrovsky, M., Procaccia, A.D. (eds.) EC \u201920: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020, pp. 795\u2013813. ACM (2020). https:\/\/doi.org\/10.1145\/3391403.3399510","DOI":"10.1145\/3391403.3399510"},{"key":"1855_CR44","doi-asserted-by":"publisher","unstructured":"Maya, A., Nisan, N: Incentive compatible two player cake cutting. In: Goldberg, P.W. (ed.) Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings, volume 7695 of Lecture Notes in Computer Science, pp. 170\u2013183. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-35311-6_13","DOI":"10.1007\/978-3-642-35311-6_13"},{"key":"1855_CR45","doi-asserted-by":"publisher","unstructured":"Procaccia, A.D., Rosenschein, J.S.: The distortion of cardinal preferences in voting. In: Klusch, M., Rovatsos, M., Payne, T.R. (eds.) Cooperative Information Agents X, 10th International Workshop, CIA 2006, Edinburgh, UK, September 11-13, 2006, Proceedings, volume 4149 of Lecture Notes in Computer Science, pp. 317\u2013331. Springer (2006). https:\/\/doi.org\/10.1007\/11839354_23","DOI":"10.1007\/11839354_23"},{"issue":"4","key":"1855_CR46","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. and Comput. 1(4), 18:1-18:26 (2013). https:\/\/doi.org\/10.1145\/2542174.2542175","journal-title":"ACM Trans. Econ. and Comput."},{"key":"1855_CR47","doi-asserted-by":"crossref","unstructured":"Stromquist, W: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb., 15(1), (2008). URL http:\/\/www.combinatorics.org\/Volume_15\/Abstracts\/v15i1r11.html","DOI":"10.37236\/735"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01855-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01855-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01855-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:07:17Z","timestamp":1707502037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01855-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,5]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1855"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01855-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,5]]},"assertion":[{"value":"28 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}