{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:55:29Z","timestamp":1745974529424,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1942321","CCF-1815901","CCF-1815901"],"award-info":[{"award-number":["CCF-1942321","CCF-1815901","CCF-1815901"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10458-024-09670-9","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T03:10:48Z","timestamp":1723432248000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["One-sided matching markets with endowments: equilibria and algorithms"],"prefix":"10.1007","volume":"38","author":[{"given":"Jugal","family":"Garg","sequence":"first","affiliation":[]},{"given":"Thorben","family":"Tr\u00f6bst","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Vazirani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"issue":"2","key":"9670_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A Hylland","year":"1979","unstructured":"Hylland, A., & Zeckhauser, R. (1979). The efficient allocation of individuals to positions. Journal of Political Economy, 87(2), 293\u2013314.","journal-title":"Journal of Political Economy"},{"key":"9670_CR2","unstructured":"Vazirani, V. V., & Yannakakis, M. (2021). Computational complexity of the Hylland\u2013Zeckhauser scheme for one-sided matching markets. In: Innovations in theoretical computer science, pp. 59\u201315919"},{"issue":"2","key":"9670_CR3","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. Journal of Economic theory, 100(2), 295\u2013328.","journal-title":"Journal of Economic theory"},{"key":"9670_CR4","unstructured":"Moulin, H. (2018). Fair division in the age of internet. Annual Review of Economics."},{"issue":"1","key":"9670_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23\u201337.","journal-title":"Journal of Mathematical Economics"},{"issue":"1","key":"9670_CR6","first-page":"1","volume":"7","author":"A Abdulkadiro\u011flu","year":"2015","unstructured":"Abdulkadiro\u011flu, A., Che, Y.-K., & Yasuda, Y. (2015). Expanding \u201cchoice\u2019\u2019 in school choice. American Economic Journal: Microeconomics, 7(1), 1\u201342.","journal-title":"American Economic Journal: Microeconomics"},{"key":"9670_CR7","unstructured":"Echenique, F., Miralles, A., & Zhang, J. (2019). Constrained pseudo-market equilibrium. arXiv preprint arXiv:1909.05986"},{"issue":"3","key":"9670_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3319394","volume":"15","author":"X Bei","year":"2019","unstructured":"Bei, X., Garg, J., & Hoefer, M. (2019). Ascending-price algorithms for unknown markets. ACM Transactions on Algorithms, 15(3), 37\u201313733.","journal-title":"ACM Transactions on Algorithms"},{"key":"9670_CR9","doi-asserted-by":"crossref","unstructured":"Garg, J., Tao, Y., & V\u00e9gh, L. A. (2022). Approximating equilibrium under constrained piecewise linear concave utilities with applications to matching markets. In: Proceedings of the 2022 ACM-SIAM symposium on discrete algorithms (SODA), pp. 2269\u20132284.","DOI":"10.1137\/1.9781611977073.91"},{"issue":"2","key":"9670_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-4068(76)90029-X","volume":"3","author":"D Gale","year":"1976","unstructured":"Gale, D. (1976). The linear exchange model. Journal of Mathematical Economics, 3(2), 205\u2013209.","journal-title":"Journal of Mathematical Economics"},{"issue":"1","key":"9670_CR11","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 dichotomous preferences. Econometrica, 72(1), 257\u2013279.","journal-title":"Econometrica"},{"key":"9670_CR12","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., & Feige, U. (2021). Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of 35th conference artificial intelligence (AAAI), pp. 5119\u20135126.","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"9670_CR13","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., & Qin, J. (2022). Fair and efficient allocations of chores under bivalued preferences. In: Proceedings of 35th conference artificial intelligence (AAAI).","DOI":"10.1609\/aaai.v35i6.16703"},{"key":"9670_CR14","unstructured":"Ebadian, S., Peters, D., & Shah, N. (2022). How to fairly allocate easy and difficult chores. In: Proceedings of 21st conference autonomous agents and multi-agent systems (AAMAS)."},{"key":"9670_CR15","doi-asserted-by":"crossref","unstructured":"Duan, R., & Mehlhorn, K. (2015). A combinatorial polynomial algorithm for the linear Arrow\u2013Debreu market. Information and Computation , 243, 112\u2013132. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013).","DOI":"10.1016\/j.ic.2014.12.009"},{"key":"9670_CR16","doi-asserted-by":"crossref","unstructured":"Duan, R., Garg, J., & Mehlhorn, K. (2016). An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market. In: Proc. 27th Symp. Discrete Algorithms (SODA), pp. 90\u2013106.","DOI":"10.1137\/1.9781611974331.ch7"},{"key":"9670_CR17","doi-asserted-by":"crossref","unstructured":"Garg, J., & V\u00e9gh, L. A. (2019). A strongly polynomial algorithm for linear exchange markets. In: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, pp. 54\u201365.","DOI":"10.1145\/3313276.3316340"},{"issue":"2","key":"9670_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2160158.2160160","volume":"59","author":"VV Vazirani","year":"2012","unstructured":"Vazirani, V. V. (2012). The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. Journal of the ACM, 59(2), 1\u201336.","journal-title":"Journal of the ACM"},{"key":"9670_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., & Gale, D. (1959). Consensus of subjective probabilities: The Pari\u2013Mutuel method. The Annals of Mathematical Statistics, 30, 165\u2013168.","journal-title":"The Annals of Mathematical Statistics"},{"key":"9670_CR20","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"2012","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (2012). Geometric Algorithms and Combinatorial Optimization (Vol. 2). Springer."},{"issue":"1","key":"9670_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0097539705447384","volume":"37","author":"K Jain","year":"2007","unstructured":"Jain, K. (2007). A polynomial time algorithm for computing an Arrow\u2013Debreu market equilibrium for linear utilities. SIAM Journal on Computing, 37(1), 303\u2013318.","journal-title":"SIAM Journal on Computing"},{"key":"9670_CR22","unstructured":"Aziz, H., Gaspers, S., Sun, Z., & Walsh, T. (2019). From matching with diversity constraints to matching with regional quotas. In: Proceedings of 18th conference autonomous agents and multi-agent systems (AAMAS), pp. 377\u2013385."},{"issue":"2","key":"9670_CR23","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10458-021-09503-z","volume":"35","author":"A Beynier","year":"2021","unstructured":"Beynier, A., Maudet, N., Rey, S., & Shams, P. (2021). Swap dynamics in single-peaked housing markets. Autonomous Agents Multi Agent Systems, 35(2), 20.","journal-title":"Autonomous Agents Multi Agent Systems"},{"issue":"5","key":"9670_CR24","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/s10458-019-09414-0","volume":"33","author":"S Gupta","year":"2019","unstructured":"Gupta, S., Panolan, F., Saurabh, S., & Zehavi, M. (2019). Stability in barter exchange markets. Autonomous Agents Multi Agent Systems, 33(5), 518\u2013539.","journal-title":"Autonomous Agents Multi Agent Systems"},{"issue":"4","key":"9670_CR25","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/s10458-018-9387-y","volume":"32","author":"H Hosseini","year":"2018","unstructured":"Hosseini, H., Larson, K., & Cohen, R. (2018). Investigating the characteristics of one-sided matching mechanisms under various preferences and risk attitudes. Autonomous Agents Multi Agent Systems, 32(4), 534\u2013567.","journal-title":"Autonomous Agents Multi Agent Systems"},{"issue":"1","key":"9670_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10458-019-09426-w","volume":"34","author":"H Aziz","year":"2020","unstructured":"Aziz, H. (2020). Strategyproof multi-item exchange under single-minded dichotomous preferences. Autonomous Agents Multi Agent Systems, 34(1), 3.","journal-title":"Autonomous Agents Multi Agent Systems"},{"key":"9670_CR27","doi-asserted-by":"crossref","unstructured":"Chen, T., Chen, X., Peng, B., & Yannakakis, M. (2022). Computational hardness of the Hylland\u2013Zeckhauser scheme. In: Proceedings of 33rd symposium discrete algorithms (SODA).","DOI":"10.1137\/1.9781611977073.90"},{"key":"9670_CR28","unstructured":"Hosseini, M., & Vazirani, V. V. (2022). Nash-bargaining-based models for matching markets: One-sided and two-sided; fisher and Arrow\u2013Debreu. In: 13th Innovations in theoretical computer science conference (ITCS)."},{"issue":"2","key":"9670_CR29","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth, A. E., S\u00f6nmez, T., & \u00dcnver, M. U. (2005). Pairwise kidney exchange. Journal of Economic Theory, 125(2), 151\u2013188.","journal-title":"Journal of Economic Theory"},{"key":"9670_CR30","doi-asserted-by":"crossref","unstructured":"Abebe, R., Cole, R., Gkatzelis, V., & Hartline, J. D. (2020). A truthful cardinal mechanism for one-sided matching. In: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, pp. 2096\u20132113. SIAM.","DOI":"10.1137\/1.9781611975994.129"},{"issue":"6","key":"9670_CR31","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"},{"issue":"3","key":"9670_CR32","first-page":"272","volume":"10","author":"Y He","year":"2018","unstructured":"He, Y., Miralles, A., Pycia, M., & Yan, J. (2018). A pseudo-market approach to allocation with priorities. American Economic Journal: Microeconomics, 10(3), 272\u2013314.","journal-title":"American Economic Journal: Microeconomics"},{"issue":"4","key":"9670_CR33","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1111\/ijet.12135","volume":"13","author":"P Le","year":"2017","unstructured":"Le, P. (2017). Competitive equilibrium in the random assignment problem. International Journal of Economic Theory, 13(4), 369\u2013385.","journal-title":"International Journal of Economic Theory"},{"key":"9670_CR34","unstructured":"McLennan, A. (2018). Efficient disposal equilibria of pseudomarkets. In: Workshop on game theory, vol. 4, p. 8."},{"key":"9670_CR35","unstructured":"Echenique, F., Miralles, A., & Zhang, J. (2019). Fairness and efficiency for probabilistic allocations with endowments. arXiv preprint arXiv:1908.04336."},{"key":"9670_CR36","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G. (1946). Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman. Series A, 5, 147\u2013154.","journal-title":"Universidad Nacional de Tucuman. Series A"},{"key":"9670_CR37","first-page":"5","volume":"2","author":"J Von Neumann","year":"1953","unstructured":"Von Neumann, J. (1953). A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games, 2, 5\u201312.","journal-title":"Contributions to the Theory of Games"},{"issue":"1","key":"9670_CR38","first-page":"6","volume":"5","author":"N Devanur","year":"2016","unstructured":"Devanur, N., Garg, J., & V\u00e9gh, L. (2016). A rational convex program for linear Arrow\u2013Debreu markets. ACM Transactions on Economics and Computation, 5(1), 6\u20131613.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9670_CR39","volume-title":"The stable marriage problem: Structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., & Irving, R. W. (1989). The stable marriage problem: Structure and algorithms. MIT press."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09670-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-024-09670-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09670-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T15:24:40Z","timestamp":1731511480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-024-09670-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9670"],"URL":"https:\/\/doi.org\/10.1007\/s10458-024-09670-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"30 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare relevant to this article\u2019s content.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"40"}}