{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:36Z","timestamp":1781345736986,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032085597","type":"print"},{"value":"9783032085603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08560-3_7","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:20Z","timestamp":1767320600000},"page":"119-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Time-Efficient Algorithms for\u00a0Nash-Bargaining-Based Matching Market Models"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Panageas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thorben","family":"Tr\u00f6bst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vijay V.","family":"Vazirani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abebe, R., Cole, R., Gkatzelis, V., Hartline, J.D.: A truthful cardinal mechanism for one-sided matching. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2096\u20132113. SIAM (2020)","DOI":"10.1137\/1.9781611975994.129"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Jalaly\u00a0Khalilabadi, P., Tardos, E.: Computing equilibrium in matching markets. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 245\u2013261 (2017)","DOI":"10.1145\/3033274.3085150"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"7_CR4","unstructured":"Basu, S., Pollack, R., Roy, M.: A new algorithm to find a point in every cell defined by a family of polynomials. Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson eds., Springer-Verlag, to appear (1995)"},{"key":"7_CR5","unstructured":"Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman, Ser. A 5, 147\u2013154 (1946)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"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. Econ. Comput. (TEAC) 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chen, T., Chen, X., Peng, B., Yannakakis, M.: Computational hardness of the hylland-Zeckhauser scheme. In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms (2022)","DOI":"10.1137\/1.9781611977073.90"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Cole, R., et al.: Convex program duality, Fisher markets, and Nash social welfare. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 459\u2013460 (2017)","DOI":"10.1145\/3033274.3085109"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/15M1053682","volume":"47","author":"R Cole","year":"2018","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. SIAM J. Comput. 47(3), 1211\u20131236 (2018)","journal-title":"SIAM J. Comput."},{"key":"7_CR10","unstructured":"Echenique, F., Immorlica, N., (Eds.), V.V.V.: Online and Matching-Based Market Design. Cambridge University Press (2022). To Appear"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Garg, R., Kapoor, S., Khandekar, R., Saberi, A.: A fast and simple algorithm for computing market equilibria. In: International Workshop on Internet and Network Economics, pp. 19\u201330. Springer (2008)","DOI":"10.1007\/978-3-540-92185-1_11"},{"key":"7_CR12","unstructured":"Gao, Y., Kroer, C.: First-order methods for large-scale market equilibrium computation. Adv. Neural Inf. Process. Syst. 33 (2020)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/140985366","volume":"26","author":"D Garber","year":"2016","unstructured":"Garber, D., Hazan, E.: A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization. SIAM J. Optim. 26(3), 1493\u20131528 (2016)","journal-title":"SIAM J. Optim."},{"key":"7_CR14","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, vol.\u00a02. Springer Science & Business Media (2012)"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1257\/mic.20150259","volume":"10","author":"Y He","year":"2018","unstructured":"He, Y., Miralles, A., Pycia, M., Yan, J.: A pseudo-market approach to allocation with priorities. American Econ. J. Microecon. 10(3), 272\u2013314 (2018)","journal-title":"American Econ. J. Microecon."},{"key":"7_CR16","unstructured":"Hosseini, M., Vazirani, V.V.: Nash-bargaining-based models for matching markets: One-sided and two-sided; fisher and arrow-debreu. In: Proceedings of the 2022 Conference on Innovations in Theoretical Computer Science, ITCS (2022)"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A Hylland","year":"1979","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293\u2013314 (1979)","journal-title":"J. Polit. Econ."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Lucier, B., Weyl, G., Mollner, J.: Approximate efficiency in matching markets. In: International Conference on Web and Internet Economics, pp. 252\u2013265. Springer (2017)","DOI":"10.1007\/978-3-319-71924-5_18"},{"key":"7_CR19","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R., et al.: Microeconomic Theory, vol. 1. Oxford University Press, New York (1995)"},{"key":"7_CR20","unstructured":"Moulin, H.: Fair division in the age of internet. Annual Review of Economics (2018)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Nash, J.: Two-person cooperative games. Econometrica: J. Econ. Soc. pp. 128\u2013140 (1953)","DOI":"10.2307\/1906951"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591725","volume":"29","author":"MW Padberg","year":"1984","unstructured":"Padberg, M.W., Wolsey, L.A.: Fractional covers for forests and matchings. Math. Program. 29(1), 1\u201314 (1984)","journal-title":"Math. Program."},{"key":"7_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, New York, NY (1986)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Tr\u00f6bst, T., Vazirani, V.V.: Cardinal-utility matching markets: The quest for envy-freeness, pareto-optimality, and efficient computability. In: Proceedings of the 2024 ACM Conference on Economics and Computation (2024)","DOI":"10.1287\/moor.2024.0770"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Vazirani, V.V.: The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. J.\u00a0ACM 59(2) (2012)","DOI":"10.1145\/2160158.2160160"},{"key":"7_CR26","unstructured":"Vazirani, V.V.: An extension of the Birkhoff-von Neumann Theorem to non-bipartite graphs. arXiv preprint arXiv:2010.05984 (2020)"},{"key":"7_CR27","unstructured":"Vazirani, V.V., Yannakakis, M.: Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets. In: 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference (2021)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Vishnoi, N.: Algorithms for Convex Optimization. Cambridge University Press (2021). To Appear","DOI":"10.1017\/9781108699211"},{"key":"7_CR29","first-page":"5","volume":"2","author":"J Von Neumann","year":"1953","unstructured":"Von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. Contrib. Theor. Games 2, 5\u201312 (1953)","journal-title":"Contrib. Theor. Games"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08560-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:22Z","timestamp":1767320602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}