{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:37:58Z","timestamp":1769978278207,"version":"3.49.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T00:00:00Z","timestamp":1529971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10458-018-9393-0","type":"journal-article","created":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T15:57:51Z","timestamp":1530028671000},"page":"741-778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods"],"prefix":"10.1007","volume":"32","author":[{"given":"Tobias","family":"Heinen","sequence":"first","affiliation":[]},{"given":"Nhan-Tam","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Trung Thanh","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"9393_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-662-47672-7_4","volume-title":"Automata, Languages, and Programming","author":"Georgios Amanatidis","year":"2015","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., & Saberi, A. (2015). Approximation algorithms for computing maximin share allocations. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science #9134 (pp. 39\u201351). Berlin: Springer."},{"key":"9393_CR2","doi-asserted-by":"crossref","unstructured":"Asadpour, A., & Saberi, A. (2007). An approximation algorithm for max-min fair allocation of indivisible goods. In Proceedings of the 39th ACM Symposium on Theory of Computing (pp. 114\u2013121). ACM.","DOI":"10.1145\/1250790.1250808"},{"key":"9393_CR3","unstructured":"Aziz, H., Bir\u00f3, P., Lang, J., Lesca, J., & Monnot, J. (2016). Optimal reallocation under additive and ordinal preferences. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 402\u2013410). IFAAMAS."},{"key":"9393_CR4","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. (2015). Fair assignment of indivisible objects under ordinal preferences. Artificial Intelligence, 227, 71\u201392.","journal-title":"Artificial Intelligence"},{"key":"9393_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rauchecker, G., Schryen, G., & Walsh, T. (2017). Algorithms for max-min share fair allocation of indivisible chores. In Proceedings of the 31th AAAI Conference on Artificial Intelligence (pp. 335\u2013341). AAAI Press.","DOI":"10.1609\/aaai.v31i1.10582"},{"key":"9393_CR6","unstructured":"Bansal, N., & Sviridenko, M. (2006). The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (pp. 31\u201340). ACM."},{"key":"9393_CR7","unstructured":"Barman, S., & Murthy, S. (2017). Approximation algorithms for maximin fair division. In: Proceedings of the 2017 ACM Conference on Economics and Computation (pp. 647\u2013664). ACM."},{"key":"9393_CR8","unstructured":"Baumeister, D., Bouveret, S., Lang, J., Nguyen, N., Nguyen, T., & Rothe, J. (2014). Scoring rules for the allocation of indivisible goods. In: Proceedings of the 21st European Conference on Artificial Intelligence (pp. 75\u201380). IOS Press."},{"issue":"3","key":"9393_CR9","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/s10458-016-9340-x","volume":"31","author":"D Baumeister","year":"2017","unstructured":"Baumeister, D., Bouveret, S., Lang, J., Nguyen, N., Nguyen, T., & Rothe, J. (2017). Positional scoring-based allocation of indivisible goods. Journal of Autonomous Agents and Multi-Agent Systems, 31(3), 628\u2013655.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"9393_CR10","unstructured":"Baumeister, D., Bouveret, S., Lang, J., Nguyen, T., Rothe, J., & Saffidine, A. (2013). Positional scoring rules for the allocation of indivisible goods. In Proceedings of the 11th European Workshop on Multi-Agent Systems."},{"issue":"3","key":"9393_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., & Dani, V. (2005). Allocating indivisible goods. SIGecom Exchanges, 5(3), 11\u201318.","journal-title":"SIGecom Exchanges"},{"issue":"1","key":"9393_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0022-0531(78)90042-X","volume":"18","author":"C Blackorby","year":"1978","unstructured":"Blackorby, C., & Donaldson, D. (1978). Measures of relative equality and their meaning in terms of social welfare. Journal of Economic Theory, 18(1), 59\u201380.","journal-title":"Journal of Economic Theory"},{"key":"9393_CR13","unstructured":"Bliem, B., Bredereck, R., & Niedermeier, R. (2016). Complexity of efficient and envy-free resource allocation: Few agents, resources, or utility levels. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (pp. 102\u2013108). AAAI Press\/IJCAI."},{"key":"9393_CR14","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., & Peters, D. (2017). Fair division of a graph. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (pp. 135\u2013141). AAAI Press\/IJCAI."},{"key":"9393_CR15","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1017\/CBO9781107446984.013","volume-title":"Handbook of computational social choice, Chapter 12","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Chevaleyre, Y., & Maudet, N. (2016). Fair allocation of indivisible goods. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice, Chapter 12 (pp. 284\u2013310). Cambridge: Cambridge University Press."},{"key":"9393_CR16","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S Bouveret","year":"2008","unstructured":"Bouveret, S., & Lang, J. (2008). Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research, 32, 525\u2013564.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9393_CR17","unstructured":"Bouveret, S., & Lang, J. (2011). A general elicitation-free protocol for allocating indivisible goods. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (pp. 73\u201378). AAAI Press\/IJCAI."},{"issue":"2","key":"9393_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., & Lema\u00eetre, M. (2016). Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Journal of Autonomous Agents and Multi-Agent Systems, 30(2), 259\u2013290.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"issue":"6","key":"9393_CR19","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E. (2011). The combinatorial assignment problem: Approximate, competitive equilibrium from equal incomes. Journal of Political Economy, 119(6), 1061\u20131103.","journal-title":"Journal of Political Economy"},{"key":"9393_CR20","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A., Shah, N., & Wang, J. (2016). The unreasonable fairness of maximum Nash welfare. In Proceedings of the 17th ACM Conference on Economics and Computation (pp. 305\u2013322). ACM.","DOI":"10.1145\/2940716.2940726"},{"key":"9393_CR21","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chuzhoy, J., & Khanna, S. (2009). On allocating goods to maximize fairness. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (pp. 107\u2013116). IEEE.","DOI":"10.1109\/FOCS.2009.51"},{"issue":"1","key":"9393_CR22","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10479-008-0335-0","volume":"163","author":"Y Chevaleyre","year":"2008","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., & Maudet, N. (2008). Multiagent resource allocation in $$k$$ k -additive domains: Preference representation and complexity. Annals of Operations Research, 163(1), 49\u201362.","journal-title":"Annals of Operations Research"},{"key":"9393_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.09.005","volume":"242","author":"Y Chevaleyre","year":"2017","unstructured":"Chevaleyre, Y., Endriss, U., & Maudet, N. (2017). Distributed fair allocation of indivisible goods. Artificial Intelligence, 242, 1\u201322.","journal-title":"Artificial Intelligence"},{"key":"9393_CR24","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V., & Goel, G. (2013). Mechanism design for fair division: Allocating divisible items without payments. In Proceedings of the 14th ACM Conference on Electronic Commerce (pp. 251\u2013268). ACM.","DOI":"10.1145\/2492002.2482582"},{"issue":"3","key":"9393_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s00355-016-0982-z","volume":"47","author":"A Darmann","year":"2016","unstructured":"Darmann, A., & Klamler, C. (2016). Proportional Borda allocations. Social Choice and Welfare, 47(3), 543\u2013558.","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"9393_CR26","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2015.05.071","volume":"247","author":"A Darmann","year":"2015","unstructured":"Darmann, A., & Schauer, J. (2015). Maximizing Nash product social welfare in allocating indivisible goods. European Journal of Operational Research, 247(2), 548\u2013559.","journal-title":"European Journal of Operational Research"},{"key":"9393_CR27","unstructured":"de\u00a0Keijzer, B., Bouveret, S., Klos, T., & Zhang, Y. (2009). On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In Proceedings of the 1st International Conference on Algorithmic Decision Theory. Lecture Notes in Computer Science\u00a0#5783 (pp. 98\u2013110). Berlin: Springer."},{"key":"9393_CR28","unstructured":"Endriss, U. (2013). Reduction of economic inequality in combinatorial domains. In Proceedings of the 12th International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 175\u2013182). IFAAMAS."},{"issue":"12","key":"9393_CR29","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","volume":"48","author":"T Erlebach","year":"2002","unstructured":"Erlebach, T., Kellerer, H., & Pferschy, U. (2002). Approximating multiobjective knapsack problems. Management Science, 48(12), 1603\u20131612.","journal-title":"Management Science"},{"issue":"4","key":"9393_CR30","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U Feige","year":"2011","unstructured":"Feige, U., Mirrokni, V., & Vondr\u00e1k, J. (2011). Maximizing non-monotone submodular functions. SIAM Journal on Computing, 40(4), 1133\u20131153.","journal-title":"SIAM Journal on Computing"},{"key":"9393_CR31","doi-asserted-by":"crossref","unstructured":"Fujita, E., Lesca, J., Sonoda, A., Todo, T., & Yokoo, M. (2015). A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (pp. 907\u2013913). AAAI Press.","DOI":"10.1609\/aaai.v29i1.9318"},{"key":"9393_CR32","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman and Company."},{"key":"9393_CR33","unstructured":"Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., & Yami, H. (2017). Fair allocation of indivisible goods: Improvement and generalization. Technical Report. arXiv:1704.00222v1 [cs.GT], Computing Research Repository (CoRR)."},{"key":"9393_CR34","unstructured":"Golden, B., & Perny, P. (2010). Infinite order Lorenz dominance for fair multiagent optimization. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (pp. 383\u2013390). IFAAMAS."},{"key":"9393_CR35","unstructured":"Golovin, D. (2005). Max-min fair allocation of indivisible goods. Technical Report. CMU-CS-05-144, School of Computer Science, Carnegie Mellon University."},{"key":"9393_CR36","first-page":"310","volume-title":"Lecture Notes in Computer Science","author":"Laurent Gourv\u00e8s","year":"2017","unstructured":"Gourv\u00e8s, L., & Monnot, J. (2017). Approximate maximin share allocations in matroids. In Proceedings of the 10th International Conference on Algorithms and Complexity. Lecture Notes in Computer Science #10236 (pp. 310\u2013321). Berlin: Springer."},{"key":"9393_CR37","unstructured":"Gourv\u00e8s, L., Monnot, J., & Tlilane, L. (2013). A matroid approach to the worst case allocation of indivisible goods. In Proceedings of the 23th International Joint Conference on Artificial Intelligence (pp. 136\u2013142). AAAI Press\/IJCAI."},{"key":"9393_CR38","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2015.04.029","volume":"589","author":"L Gourv\u00e8s","year":"2015","unstructured":"Gourv\u00e8s, L., Monnot, J., & Tlilane, L. (2015). Worst case compromises in matroids with applications to the allocation of indivisible goods. Theoretical Computer Science, 589, 121\u2013140.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9393_CR39","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2), 416\u2013429.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"9393_CR40","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-23114-3_31","volume-title":"Algorithmic Decision Theory","author":"Tobias Heinen","year":"2015","unstructured":"Heinen, T., Nguyen, N., & Rothe, J. (2015). Fairness and rank-weighted utilitarianism in resource allocation. In Proceedings of the 4th International Conference on Algorithmic Decision Theory. Lecture Notes in Artificial Intelligence\u00a0#9346 (pp. 521\u2013536). Berlin: Springer."},{"issue":"2","key":"9393_CR41","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1214\/aop\/1176992173","volume":"15","author":"T Hill","year":"1987","unstructured":"Hill, T. (1987). Partitioning general probability measures. The Annals of Probability, 15(2), 804\u2013813.","journal-title":"The Annals of Probability"},{"issue":"1","key":"9393_CR42","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM, 34(1), 144\u2013162.","journal-title":"Journal of the ACM"},{"key":"9393_CR43","unstructured":"Kurokawa, D., Procaccia, A., & Wang, J. (2016). When can the maximin share guarantee be guaranteed? In Proceedings of the 30th AAAI Conference on Artificial Intelligence (pp. 523\u2013529). AAAI Press."},{"key":"9393_CR44","first-page":"493","volume-title":"Economics and computation: An introduction to algorithmic game theory, computational social choice, and fair division, Springer Texts in Business and Economics, Chap. 8","author":"J Lang","year":"2015","unstructured":"Lang, J., & Rothe, J. (2015). Fair division of indivisible goods. In J. Rothe (Ed.), Economics and computation: An introduction to algorithmic game theory, computational social choice, and fair division, Springer Texts in Business and Economics, Chap. 8 (pp. 493\u2013550). Berlin: Springer."},{"key":"9393_CR45","unstructured":"Lesca, J., & Perny, P. (2010). LP Solvable Models for Multiagent Fair Allocation Problems. In Proceedings of the 19th European Conference on Artificial Intelligence (pp. 393\u2013398). IOS Press."},{"key":"9393_CR46","first-page":"278","volume-title":"Lecture Notes in Computer Science","author":"Evangelos Markakis","year":"2011","unstructured":"Markakis, E., & Psomas, C. (2011). On worst-case allocations in the presence of indivisible goods. In Proceedings of the 7th International Workshop on Internet & Network Economics Lecture Notes in Computer Science #7090 (pp. 278\u2013289). Berlin: Springer."},{"key":"9393_CR47","volume-title":"Inequalities: Theory of majorization and its applications","author":"A Marshall","year":"2010","unstructured":"Marshall, A., Olkin, I., & Arnold, B. (2010). Inequalities: Theory of majorization and its applications. Berlin: Springer."},{"key":"9393_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL0521360552","volume-title":"Axioms of cooperative decision making","author":"H Moulin","year":"1988","unstructured":"Moulin, H. (1988). Axioms of cooperative decision making. Cambridge: Cambridge University Press."},{"issue":"3","key":"9393_CR49","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0047-2727(90)90003-Z","volume":"43","author":"H Moulin","year":"1990","unstructured":"Moulin, H. (1990). Uniform externalities: Two axioms for fair allocation. Journal of Public Economics, 43(3), 305\u2013326.","journal-title":"Journal of Public Economics"},{"issue":"2","key":"9393_CR50","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash, J. (1950). The bargaining problem. Econometrica, 18(2), 155\u2013162.","journal-title":"Econometrica"},{"key":"9393_CR51","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0962492906370018","volume":"17","author":"A Nemirovski","year":"2008","unstructured":"Nemirovski, A., & Todd, M. (2008). Interior-point methods for optimization. Acta Numerica, 17, 191\u2013234.","journal-title":"Acta Numerica"},{"key":"9393_CR52","unstructured":"Nguyen, N., Baumeister, D., & Rothe, J.: Strategy-proofness of scoring allocation correspondences for indivisible goods. Social Choice and Welfare (forthcoming). A preliminary version appeared in Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI\u00a02015) (pp.\u00a01127\u20131133). AAAI Press\/IJCAI."},{"issue":"2","key":"9393_CR53","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s10458-013-9224-2","volume":"28","author":"N Nguyen","year":"2014","unstructured":"Nguyen, N., Nguyen, T., Roos, M., & Rothe, J. (2014). Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Journal of Autonomous Agents and Multi-Agent Systems, 28(2), 256\u2013289.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"9393_CR54","unstructured":"Nguyen, N., Nguyen, T., & Rothe, J. (2017). Approximate solutions to max-min fair and proportionally fair allocations of indivisible goods. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (pp. 262\u2013271). IFAAMAS."},{"issue":"1\u20133","key":"9393_CR55","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10472-012-9328-4","volume":"68","author":"T Nguyen","year":"2013","unstructured":"Nguyen, T., Roos, M., & Rothe, J. (2013). A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Annals of Mathematics and Artificial Intelligence, 68(1\u20133), 65\u201390.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9393_CR56","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1995","unstructured":"Papadimitriou, C. (1995). Computational complexity (2nd ed.). Boston: Addison-Wesley.","edition":"2"},{"key":"9393_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2013.10.030","volume":"167","author":"S Porschen","year":"2014","unstructured":"Porschen, S., Schmidt, T., Speckenmeyer, E., & Wotzlaw, A. (2014). XSAT and NAE-SAT of linear CNF classes. Discrete Applied Mathematics, 167, 1\u201314.","journal-title":"Discrete Applied Mathematics"},{"key":"9393_CR58","doi-asserted-by":"crossref","unstructured":"Procaccia, A., & Wang, J. (2014). Fair enough: Guaranteeing approximate maximin shares. In Proceedings of the 15th ACM Conference on Economics and Computation (pp. 675\u2013692). ACM.","DOI":"10.1145\/2600057.2602835"},{"key":"9393_CR59","first-page":"117","volume-title":"Lecture Notes in Business Information Processing","author":"Sara Ramezani","year":"2010","unstructured":"Ramezani, S., & Endriss, U. (2010). Nash social welfare in multiagent resource allocation. In Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. AMEC 2009, TADA 2009. Lecture Notes in Business Information Processing #59 (pp. 117\u2013131). Berlin: Springer."},{"key":"9393_CR60","volume-title":"Complexity theory and cryptology: An introduction to cryptocomplexity. EATCS Texts in Theoretical Computer Science","author":"J Rothe","year":"2005","unstructured":"Rothe, J. (2005). Complexity theory and cryptology: An introduction to cryptocomplexity. EATCS Texts in Theoretical Computer Science. Berlin: Springer."},{"key":"9393_CR61","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Aziz, H., & Hassidim, A. (2017). Fair allocation based on diminishing differences. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (pp. 1254\u20131261). AAAI Press\/IJCAI.","DOI":"10.24963\/ijcai.2017\/174"},{"issue":"1","key":"9393_CR62","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H. (1948). The problem of fair division. Econometrica, 16(1), 101\u2013104.","journal-title":"Econometrica"},{"key":"9393_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2003","unstructured":"Vazirani, V. (2003). Approximation algorithms (2nd ed.). Berlin: Springer.","edition":"2"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-018-9393-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9393-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9393-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T12:17:28Z","timestamp":1661516248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-018-9393-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,26]]},"references-count":63,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["9393"],"URL":"https:\/\/doi.org\/10.1007\/s10458-018-9393-0","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,26]]},"assertion":[{"value":"26 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}