{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:18Z","timestamp":1740182418204,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS KAKENHI","award":["19K03598","20K04970"],"award-info":[{"award-number":["19K03598","20K04970"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s43069-021-00095-8","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Extended Random Assignment Mechanisms on a Family of Good Sets"],"prefix":"10.1007","volume":"2","author":[{"given":"Yoshio","family":"Sano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1183-1550","authenticated-orcid":false,"given":"Ping","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"issue":"2","key":"95_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia A, Moulin H (2001) A new solution to the random assignment problem. J Econ Theory 100(2):295\u2013328","journal-title":"J Econ Theory"},{"unstructured":"Aziz A, Brandl F (2020) The vigilant eating rule: a general approach for probabilistic economic design with constraints. http:\/\/arxiv-export-lb.library.cornell.edu\/pdf\/2008.08991","key":"95_CR2"},{"issue":"2","key":"95_CR3","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.jet.2012.09.016","volume":"148","author":"O Bochet","year":"2013","unstructured":"Bochet O, \u0130lk\u0131l\u0131\u00e7 R, Moulin H (2013) Egalitarianism under earmark constraints. J Econ Theory 148(2):535\u2013562","journal-title":"J Econ Theory"},{"key":"95_CR4","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jet.2015.04.008","volume":"158","author":"A Bogomolnaia","year":"2015","unstructured":"Bogomolnaia A (2015) Random assignment: redefining the serial rule. J Econ Theory 158:308\u2013318","journal-title":"J Econ Theory"},{"issue":"2","key":"95_CR5","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1257\/aer.103.2.585","volume":"103","author":"E Budish","year":"2013","unstructured":"Budish E, Che YK, Kojima F, Milgrom P (2013) Designing random allocation mechanisms: theory and applications. Am Econ Rev 103(2):585\u2013623","journal-title":"Am Econ Rev"},{"key":"95_CR6","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.jet.2018.08.002","volume":"177","author":"T Hashimoto","year":"2018","unstructured":"Hashimoto T (2018) The generalized random priority mechanism with budgets. J Econ Theory 177:708\u2013733","journal-title":"J Econ Theory"},{"key":"95_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.3982\/TE1010","volume":"9","author":"T Hashimoto","year":"2014","unstructured":"Hashimoto T, Hirata D, Kesten O, Kurino M, \u00dcnver MU (2014) Two axiomatic approaches to the probabilistic serial mechanism. Theor Econ 9:253\u2013277","journal-title":"Theor Econ"},{"issue":"1","key":"95_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"AK Katta","year":"2006","unstructured":"Katta AK, Sethuraman J (2006) A solution to the random assignment problem on the full preference domain. J Econ Theory 131(1):231\u2013250","journal-title":"J Econ Theory"},{"key":"95_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jet.2015.12.002","volume":"162","author":"H Moulin","year":"2016","unstructured":"Moulin H (2016) Entropy, desegregation, and proportional rationing. J Econ Theory 162:1\u201320","journal-title":"J Econ Theory"},{"issue":"2","key":"95_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.3982\/TE2307","volume":"12","author":"H Moulin","year":"2017","unstructured":"Moulin H (2017) One dimensional mechanism design. Theor Econ 12(2):587\u2013619","journal-title":"Theor Econ"},{"unstructured":"Fujishige S, Sano Y, Zhan P (2016) A solution to the random assignment problem with a matroidal family of goods. RIMS Preprint RIMS-1852, Kyoto University, May","key":"95_CR11"},{"issue":"1","key":"95_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3175496","volume":"6","author":"S Fujishige","year":"2018","unstructured":"Fujishige S, Sano Y, Zhan P (2018) The random assignment problem with submodular constraints on goods. ACM Trans Econ Comput 6(1):1\u201328. https:\/\/doi.org\/10.1145\/3175496","journal-title":"ACM Trans Econ Comput"},{"key":"95_CR13","first-page":"189","volume":"21","author":"S Fujishige","year":"1978","unstructured":"Fujishige S (1978) Algorithms for solving the independent-flow problems. J Oper Res Jpn 21:189\u2013204","journal-title":"J Oper Res Jpn"},{"key":"95_CR14","volume-title":"Submodular functions and optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige S (2005) Submodular functions and optimization, 2nd edn. Elsevier, Amsterdam","edition":"2"},{"issue":"1","key":"95_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia A, Moulin H (2004) Random matching under dichotoBCKM2013mous preference. Econometrica 72(1):257\u2013279","journal-title":"Econometrica"},{"key":"95_CR16","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jet.2018.01.011","volume":"175","author":"B Do\u011fan","year":"2018","unstructured":"Do\u011fan B, Do\u011fan S, Yildiz K (2018) A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism. J Econ Theory 175:178\u2013200","journal-title":"J Econ Theory"},{"key":"95_CR17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid theory","author":"J Oxley","year":"2011","unstructured":"Oxley J (2011) Matroid theory, 2nd edn. Oxford University Press, Oxford","edition":"2"},{"key":"95_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0169-7218(10)00021-3","volume-title":"Fair allocation rules. Handbook of social choice and welfare","author":"W Thomson","year":"2011","unstructured":"Thomson W (2011) Fair allocation rules. Handbook of social choice and welfare, vol II. Elsevier, Amsterdam, pp 393\u2013506"},{"issue":"2","key":"95_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S Fujishige","year":"1980","unstructured":"Fujishige S (1980) Lexicographically optimal base of a polymatroid with respect to a weight vector. Math Oper Res 5(2):186\u2013196","journal-title":"Math Oper Res"},{"key":"95_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s10878-020-00560-w","volume":"40","author":"X Li","year":"2020","unstructured":"Li X, Du HG, Pardalos PM (2020) A variation of DS decomposition in set function optimization. J Comb Opt 40:36\u201344","journal-title":"J Comb Opt"},{"issue":"1","key":"95_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley LS (1971) Cores of convex games. Int J Game Theory 1(1):11\u201326","journal-title":"Int J Game Theory"},{"issue":"1\u20132","key":"95_CR22","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10107-018-1310-4","volume":"178","author":"S Fujishige","year":"2019","unstructured":"Fujishige S, Sano Y, Zhan P (2019) Submodular optimization views on the random assignment problem. Math Program 178(1\u20132):485\u2013501","journal-title":"Math Program"},{"issue":"3","key":"95_CR23","doi-asserted-by":"publisher","first-page":"615","DOI":"10.2307\/1911055","volume":"57","author":"B Dutta","year":"1989","unstructured":"Dutta B, Ray D (1989) A concept of egalitarianism under participation constraints. Econometrica 57(3):615\u2013635","journal-title":"Econometrica"},{"issue":"1","key":"95_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N Megiddo","year":"1974","unstructured":"Megiddo N (1974) Optimal flows in networks with multiple sources and sinks. Math Program 7(1):97\u2013107","journal-title":"Math Program"},{"key":"95_CR25","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jmateco.2014.08.003","volume":"54","author":"EJ Heo","year":"2014","unstructured":"Heo EJ (2014) Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization. J Math Econ 54:40\u201347","journal-title":"J Math Econ"},{"unstructured":"Schulman LJ, Vazirani VV (2015) Allocation of divisible goods under lexicographic preferences. In: Harsha P, Ramalingam G (ed) Proceedings of 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Sciences (FSTTCS\u201915), Dagstuhl Publishing, pp 543\u2013559","key":"95_CR26"},{"issue":"1","key":"95_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00355-018-1110-z","volume":"51","author":"WJ Cho","year":"2018","unstructured":"Cho WJ (2018) Probabilistic assignment: an extension approach. Soc Choice Welf 51(1):137\u2013162","journal-title":"Soc Choice Welf"},{"key":"95_CR28","doi-asserted-by":"publisher","first-page":"104942","DOI":"10.1016\/j.jet.2019.104942","volume":"184","author":"A Nicol\u00f2","year":"2019","unstructured":"Nicol\u00f2 A, Sen A, Yadav S (2019) Matching with partners and projects. J Econ Theory 184:104942","journal-title":"J Econ Theory"},{"key":"95_CR29","doi-asserted-by":"publisher","first-page":"104952","DOI":"10.1016\/j.jet.2019.104952","volume":"185","author":"O Bochet","year":"2020","unstructured":"Bochet O, Tumennasan N (2020) Dominance of truthtelling and the lattice structure of Nash equilibria. J Econ Theory 185:104952","journal-title":"J Econ Theory"},{"key":"95_CR30","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s00186-019-00685-7","volume":"90","author":"P Zhan","year":"2019","unstructured":"Zhan P (2019) A simple construction of complete single-peaked domains by recursive tiling. Math Methods Oper Res 90:477\u2013488","journal-title":"Math Methods Oper Res"},{"key":"95_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial optimization-theory and algorithms","author":"B Korte","year":"2018","unstructured":"Korte B, Vygen J (2018) Combinatorial optimization-theory and algorithms, 6th edn. Springer, Berlin","edition":"6"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00095-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00095-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00095-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T06:21:15Z","timestamp":1640586075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00095-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,5]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["95"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00095-8","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,10,5]]},"assertion":[{"value":"13 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}