{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T06:44:18Z","timestamp":1704955458521},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00355-020-01278-8","type":"journal-article","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T19:03:51Z","timestamp":1598555031000},"page":"291-324","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximin share guarantee for goods with positive externalities"],"prefix":"10.1007","volume":"56","author":[{"given":"Masoud","family":"Seddighin","sequence":"first","affiliation":[]},{"given":"Hamed","family":"Saleh","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"1278_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis G, Birmpas G, Christodoulou G, Markakis E (2017) Truthful allocation mechanisms without payments: Characterization and implications on fairness. In: Proceedings of the 2017 ACM conference on economics and computation. ACM, pp 545\u2013562","DOI":"10.1145\/3033274.3085147"},{"key":"1278_CR2","unstructured":"Amanatidis G, Birmpas G, Markakis E (2016) On truthful mechanisms for maximin share allocations. In: Proceedings of the twenty-fifth international joint conference on artificial intelligence. AAAI Press, pp 31\u201337"},{"key":"1278_CR3","doi-asserted-by":"crossref","unstructured":"Amanatidis G, Markakis E, Nikzad A, Saberi A (2015) Approximation algorithms for computing maximin share allocations. In: International colloquium on automata, languages, and programming. Springer, pp 39\u201351","DOI":"10.1007\/978-3-662-47672-7_4"},{"key":"1278_CR4","doi-asserted-by":"crossref","unstructured":"Anari N, Ehsani S, Ghodsi M, Haghpanah N, Immorlica N, Mahini H, Mirrokni VS (2010) Equilibrium pricing with positive externalities. In: International workshop on internet and network economics. Springer, pp 424\u2013431","DOI":"10.1007\/978-3-642-17572-5_35"},{"key":"1278_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: AAAI conference on artificial intelligence, vol\u00a017. AAAI Press, pp 335\u2013341","DOI":"10.1609\/aaai.v31i1.10582"},{"key":"1278_CR6","doi-asserted-by":"crossref","unstructured":"Barman S, Biswas A, Krishnamurthy SK, Narahari Y (2018) Groupwise maximin fair allocation of indivisible goods. In: Thirty-second AAAI conference on artificial intelligence. AAAI Press, pp 917\u2013924","DOI":"10.1609\/aaai.v32i1.11463"},{"key":"1278_CR7","doi-asserted-by":"crossref","unstructured":"Barman S, Krishna Murthy SK (2017) Approximation algorithms for maximin fair division. In: Proceedings of the 2017 ACM conference on economics and computation. ACM, pp 647\u2013664","DOI":"10.1145\/3033274.3085136"},{"key":"1278_CR8","unstructured":"Br\u00e2nzei S, Michalak T, Rahwan T, Larson K, Jennings NR (2013) Matchings with externalities and attitudes. In: Proceedings of the 2013 international conference on autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, pp 295\u2013302"},{"key":"1278_CR9","unstructured":"Br\u00e2nzei S, Procaccia AD, Zhang J (2013) Externalities in cake cutting. In: International joint conference on artificial intelligence, pp 55\u201361"},{"issue":"6","key":"1278_CR10","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. J Polit Econ 119(6):1061\u20131103","journal-title":"J Polit Econ"},{"key":"1278_CR11","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge"},{"issue":"119","key":"1278_CR12","doi-asserted-by":"publisher","first-page":"348","DOI":"10.2307\/2223525","volume":"30","author":"H Dalton","year":"1920","unstructured":"Dalton H (1920) The measurement of the inequality of incomes. Econ J 30(119):348\u2013361","journal-title":"Econ J"},{"issue":"2","key":"1278_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"BL Deuermeyer","year":"1982","unstructured":"Deuermeyer BL, Friesen DK, Langston MA (1982) Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J Algebraic Discrete Methods 3(2):190\u2013196","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"1278_CR14","unstructured":"Farhadi A, Hajiaghayi MT, Ghodsi M, Lahaie S, Pennock D, Seddighin M, Seddighin S, Yami H (2017) Fair allocation of indivisible goods to asymmetric agents. In: Proceedings of the 16th conference on autonomous agents and multiagent systems. International Foundation for Autonomous Agents and Multiagent Systems, pp 1535\u20131537"},{"key":"1278_CR15","doi-asserted-by":"crossref","unstructured":"Ghodsi M, Hajiaghayi MT, Seddighin M, Seddighin S, Yami H (2018) Fair allocation of indivisible goods: improvements and generalizations. In: Proceedings of the 2018 ACM conference on economics and computation. ACM, pp 539\u2013556","DOI":"10.1145\/3219166.3219238"},{"key":"1278_CR16","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s L, Monnot J (2017) Approximate maximin share allocations in matroids. In: International conference on algorithms and complexity. Springer, pp 310\u2013321","DOI":"10.1007\/978-3-319-57586-5_26"},{"issue":"2","key":"1278_CR17","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"1278_CR18","doi-asserted-by":"crossref","unstructured":"Haghpanah N, Immorlica N, Mirrokni V, Munagala K (2011) Optimal auctions with positive network externalities. In: Proceedings of the 12th ACM conference on electronic commerce. ACM, pp 11\u201320","DOI":"10.1145\/1993574.1993577"},{"key":"1278_CR19","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy GH, Littlewood JE, P\u00f3lya G, Littlewood DE, P\u00f3lya G et al (1952) Inequalities. Cambridge University Press, Cambridge"},{"key":"1278_CR20","doi-asserted-by":"crossref","unstructured":"Heinen T, Nguyen N-T, Nguyen TT, Rothe J (2018) Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods. In: Autonomous agents and multi-agent systems, pp 1\u201338","DOI":"10.1007\/s10458-018-9393-0"},{"key":"1278_CR21","doi-asserted-by":"crossref","unstructured":"Hong M, Park J (2018) Core and top trading cycles in a market with indivisible goods and externalities","DOI":"10.2139\/ssrn.3710055"},{"key":"1278_CR22","doi-asserted-by":"crossref","unstructured":"Kempe D, Mahdian M (2008) A cascade model for externalities in sponsored search. In: International workshop on internet and network economics. Springer, pp 585\u2013596","DOI":"10.1007\/978-3-540-92185-1_65"},{"key":"1278_CR23","doi-asserted-by":"crossref","unstructured":"Kurokawa D, Procaccia AD, Shah N (2015) Leximin allocations in the real world. In: Proceedings of the sixteenth ACM conference on economics and computation. ACM, pp 345\u2013362","DOI":"10.1145\/2764468.2764490"},{"key":"1278_CR24","unstructured":"Kurokawa D, Procaccia AD, Wang J (2016) When can the maximin share guarantee be guaranteed? In: AAAI conference on artificial intelligence, vol 16. AAAI Press, pp 523\u2013529"},{"key":"1278_CR25","doi-asserted-by":"crossref","unstructured":"Leme RP, Syrgkanis V, Tardos \u00c9 (2012) Sequential auctions and externalities. In: Proceedings of the twenty-third annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 869\u2013886","DOI":"10.1137\/1.9781611973099.70"},{"key":"1278_CR26","unstructured":"Li M, Zhang J, Zhang Q (2015) Truthful cake cutting mechanisms with externalities: do not make them care for others too much! In: International joint conference on artificial intelligence, pp 589\u2013595"},{"key":"1278_CR27","doi-asserted-by":"crossref","unstructured":"Mirrokni VS, Roch S, Sundararajan M (2012) On fixed-price marketing for goods with positive network externalities. In: WINE. Springer, pp 532\u2013538","DOI":"10.1007\/978-3-642-35311-6_43"},{"key":"1278_CR28","doi-asserted-by":"crossref","unstructured":"Procaccia AD, Wang J (2014) Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the fifteenth ACM conference on economics and computation. ACM, pp 675\u2013692","DOI":"10.1145\/2600057.2602835"},{"issue":"1","key":"1278_CR29","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":"1278_CR30","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.mathsocsci.2017.09.004","volume":"92","author":"W Suksompong","year":"2018","unstructured":"Suksompong W (2018) Approximate maximin shares for groups of agents. Math Soc Sci 92:40\u201347","journal-title":"Math Soc Sci"},{"issue":"1","key":"1278_CR31","doi-asserted-by":"publisher","first-page":"381","DOI":"10.3982\/TE1651","volume":"11","author":"RA Velez","year":"2016","unstructured":"Velez RA (2016) Fairness and externalities. Theor Econ 11(1):381\u2013410","journal-title":"Theor Econ"},{"issue":"4","key":"1278_CR32","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0165-4896(81)90018-4","volume":"1","author":"JA Weymark","year":"1981","unstructured":"Weymark JA (1981) Generalized Gini inequality indices. Math Soc Sci 1(4):409\u2013430","journal-title":"Math Soc Sci"},{"issue":"4","key":"1278_CR33","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger GJ (1997) A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper Res Lett 20(4):149\u2013154","journal-title":"Oper Res Lett"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-020-01278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00355-020-01278-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-020-01278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T13:45:02Z","timestamp":1668087902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00355-020-01278-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,27]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1278"],"URL":"https:\/\/doi.org\/10.1007\/s00355-020-01278-8","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"value":"0176-1714","type":"print"},{"value":"1432-217X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,27]]},"assertion":[{"value":"24 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}