{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:15Z","timestamp":1742913975638,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777518"},{"type":"electronic","value":"9789819777525"}],"license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"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":[[2025]]},"DOI":"10.1007\/978-981-97-7752-5_20","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:06:08Z","timestamp":1735380368000},"page":"270-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic and\u00a0Universal Truthful Mechanism for\u00a0Fair Matching"],"prefix":"10.1007","author":[{"given":"Hao","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinshan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"20_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":"20_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D., Chen, N., Kumar, V., Mirrokni, V.S.: Assignment problems in rental markets. In: Internet and Network Economics: Second International Workshop, WINE 2006, Patras, Greece, 15\u201317 December 2006. Proceedings 2, pp. 198\u2013213. Springer (2006)","DOI":"10.1007\/11944874_19"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Adamczyk, M., Sankowski, P., Zhang, Q.: Efficiency of truthful and symmetric mechanisms in one-sided matching. In: International Symposium on Algorithmic Game Theory, pp. 13\u201324. Springer (2014)","DOI":"10.1007\/978-3-662-44803-8_2"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Christodoulou, G., Markakis, E.: Truthful allocation mechanisms without payments: Characterization and implications on fairness. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 545\u2013562 (2017)","DOI":"10.1145\/3033274.3085147"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Azad, A., Bulu\u00e7, A.: Distributed-memory algorithms for maximum cardinality matching in bipartite graphs. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 32\u201342. IEEE (2016)","DOI":"10.1109\/IPDPS.2016.103"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Swamy, C.: Welfare maximization and truthfulness in mechanism design with ordinal preferences. In: Proceedings of the 5th conference on Innovations in Theoretical Computer Science, pp. 105\u2013120 (2014)","DOI":"10.1145\/2554797.2554810"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Duan, R., Su, H.H.: A scaling algorithm for maximum weight matching in bipartite graphs. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1413\u20131424. SIAM (2012)","DOI":"10.1137\/1.9781611973099.111"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 325\u2013334 (2010)","DOI":"10.1145\/1807342.1807394"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"AL Dulmage","year":"1958","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Coverings of bipartite graphs. Can. J. Math. 10, 517\u2013534 (1958)","journal-title":"Can. J. Math."},{"key":"20_CR10","first-page":"135","volume":"7","author":"A Gerards","year":"1995","unstructured":"Gerards, A.: Matching. Handb. Oper. Res. Manag. Sci. 7, 135\u2013224 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"20_CR11","first-page":"87","volume":"12","author":"CC Huang","year":"2012","unstructured":"Huang, C.C., Kavitha, T.: Weight-maximal matchings. Proc. MATCH-UP 12, 87\u201398 (2012)","journal-title":"Proc. MATCH-UP"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1007\/s00453-015-9994-9","volume":"74","author":"CC Huang","year":"2016","unstructured":"Huang, C.C., Kavitha, T., Mehlhorn, K., Michail, D.: Fair matchings and related problems. Algorithmica 74(3), 1184\u20131203 (2016)","journal-title":"Algorithmica"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"RW Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: Rank-maximal matchings. ACM Trans. Algorithms (TALG) 2(4), 602\u2013610 (2006)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Shah, C.D.: Efficient algorithms for weighted rank-maximal matchings and related problems. In: International Symposium on Algorithms and Computation, pp. 153\u2013162. Springer (2006)","DOI":"10.1007\/11940128_17"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: European Symposium on Algorithms, pp. 589\u2013600. Springer (2013)","DOI":"10.1007\/978-3-642-40450-4_50"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Korula, N., Mirrokni, V.S., Zadimoghaddam, M.: Bicriteria online matching: maximizing weight and cardinality. In: Web and Internet Economics: 9th International Conference, WINE 2013, Cambridge, MA, USA, 11\u201314 December 2013, Proceedings 9, pp. 305\u2013318. Springer (2013)","DOI":"10.1007\/978-3-642-45046-4_25"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the house allocation problem. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 453\u2013470 (2014)","DOI":"10.1145\/2600057.2602868"},{"key":"20_CR18","unstructured":"Krysta, P., Zhang, J.: House markets with matroid and knapsack constraints. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"1\u20132","key":"20_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logistics Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logistics Q."},{"key":"20_CR20","unstructured":"Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications (2005)"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(94)90039-6","volume":"55","author":"AP Punnen","year":"1994","unstructured":"Punnen, A.P., Nair, K.: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem. Discret. Appl. Math. 55(1), 91\u201393 (1994)","journal-title":"Discret. Appl. Math."},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Reiffenhauser, R.: An optimal truthful mechanism for the online weighted bipartite matching problem. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1982\u20131993. SIAM (2019)","DOI":"10.1137\/1.9781611975482.120"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Schwartz, J., Steger, A., Wei\u00dfl, A.: Fast algorithms for weighted bipartite matching. In: International Workshop on Experimental and Efficient Algorithms, pp. 476\u2013487. Springer (2005)","DOI":"10.1007\/11427186_41"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, J., Liu, Z., Deng, X., Yin, J.: Improved truthful rank approximation for rank-maximal matchings. In: International Conference on Web and Internet Economics, pp. 637\u2013653. Springer (2023)","DOI":"10.1007\/978-3-031-48974-7_36"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7752-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:24:01Z","timestamp":1739305441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7752-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"ISBN":["9789819777518","9789819777525"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7752-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"29 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"29 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}