{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:47:36Z","timestamp":1742957256299,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_36","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"637-653","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Truthful Rank Approximation for Rank-Maximal Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3427-9014","authenticated-orcid":false,"given":"Jinshan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1760-3305","authenticated-orcid":false,"given":"Zhengyang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5282-6467","authenticated-orcid":false,"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4703-7348","authenticated-orcid":false,"given":"Jianwei","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A Abdulkadiro\u011flu","year":"1998","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1253\u20131264 (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ins.2021.11.059","volume":"587","author":"E Aigner-Horev","year":"2022","unstructured":"Aigner-Horev, E., Segal-Halevi, E.: Envy-free matchings in bipartite graphs and their applications to fair division. Inf. Sci. 587, 164\u2013187 (2022)","journal-title":"Inf. Sci."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Sun, Z.: Multi-rank smart reserves. In: Proceedings of the 22nd ACM Conference on Economics and Computation (EC), pp. 105\u2013124 (2021)","DOI":"10.1145\/3465456.3467619"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Luo, P., Rizkallah, C.: Rank maximal equal contribution: a probabilistic social choice function. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI), vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11448"},{"key":"36_CR6","unstructured":"Aziz, H., Huang, X., Mattei, N., Segal-Halevi, E.: The constrained round robin algorithm for fair and efficient allocation (2019). arXiv preprint arXiv:1908.00161"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Belahcene, K., Mousseau, V., Wilczynski, A.: Combining fairness and optimality when selecting and allocating projects. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI) (2021)","DOI":"10.24963\/ijcai.2021\/6"},{"issue":"2","key":"36_CR8","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.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.geb.2014.11.006","volume":"90","author":"A Bogomolnaia","year":"2015","unstructured":"Bogomolnaia, A., Moulin, H.: Size versus fairness in the assignment problem. Games Econ. Behav. (GEB) 90, 119\u2013127 (2015)","journal-title":"Games Econ. Behav. (GEB)"},{"key":"36_CR10","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 (ITCS), pp. 105\u2013120 (2014)","DOI":"10.1145\/2554797.2554810"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Coverings of bipartite graphs. Can. J. Math. 10, 517\u2013534 (1958)","DOI":"10.4153\/CJM-1958-052-0"},{"issue":"6","key":"36_CR12","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1017\/S1471068420000277","volume":"20","author":"E Erdem","year":"2020","unstructured":"Erdem, E., Fidan, M., Manlove, D., Prosser, P.: A general framework for stable roommates problems using answer set programming. Theory Pract. Log. Program. 20(6), 911\u2013925 (2020)","journal-title":"Theory Pract. Log. Program."},{"key":"36_CR13","unstructured":"Galichon, A., Ghelfi, O., Henry, M.: Stable and extremely unequal (2021). arXiv preprint arXiv:2108.06587"},{"key":"36_CR14","doi-asserted-by":"publisher","unstructured":"Ghosal, P., Paluch, K.E.: Manipulation strategies for the rank-maximal matching problem. In: Wang, L., Zhu, D. (eds.) Computing and Combinatorics. COCOON 2018. LNCS, vol. 10976, pp. 316\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_27","DOI":"10.1007\/978-3-319-94776-1_27"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2018.09.033","volume":"767","author":"P Ghosal","year":"2019","unstructured":"Ghosal, P., Nasre, M., Nimbhorkar, P.: Rank-maximal matchings-structure and algorithms. Theor. Comput. Sci. (TCS) 767, 73\u201382 (2019)","journal-title":"Theor. Comput. Sci. (TCS)"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Hosseini, H., Menon, V., Shah, N., Sikdar, S.: Necessarily optimal one-sided matchings. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), vol. 35, pp. 5481\u20135488 (2021)","DOI":"10.1609\/aaai.v35i6.16690"},{"key":"36_CR17","unstructured":"Huang, C.-C., Kavitha, T.: Weight-maximal matchings. In: Proceedings of the 2nd International Workshop on Matching Under Preferences (MATCH-UP), vol. 12, pp. 87\u201398 (2012)"},{"issue":"2","key":"36_CR18","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."},{"issue":"4","key":"36_CR19","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":"36_CR20","unstructured":"Irving, R.W.: Greedy matchings, 2003. Technical report Tr-2003-136, University of Glasgow"},{"issue":"1","key":"36_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1257\/aer.20101552","volume":"105","author":"Y Kamada","year":"2015","unstructured":"Kamada, Y., Kojima, F.: Efficient matching under distributional constraints: theory and applications. Am. Econ. Rev. 105(1), 67\u201399 (2015)","journal-title":"Am. Econ. Rev."},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11940128_17","volume-title":"Algorithms and Computation","author":"T Kavitha","year":"2006","unstructured":"Kavitha, T., Shah, C.D.: Efficient algorithms for weighted rank-maximal matchings and related problems. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 153\u2013162. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11940128_17"},{"key":"36_CR23","unstructured":"Krysta, P.J., Zhang, J.: House markets with matroid and knapsack constraints. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP) (2016)"},{"issue":"9","key":"36_CR24","doi-asserted-by":"publisher","first-page":"3422","DOI":"10.1007\/s00453-019-00584-7","volume":"81","author":"P Krysta","year":"2019","unstructured":"Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the house allocation problem. Algorithmica 81(9), 3422\u20133463 (2019)","journal-title":"Algorithmica"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Nimbhorkar, P., Rameshwar, V.A.: Dynamic rank-maximal and popular matchings. J. Comb. Optim. 37(2), 523\u2013545 (2019)","DOI":"10.1007\/s10878-018-0348-9"},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"Paluch, K.: Capacitated rank-maximal matchings. In: Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), pp. 324\u2013335 (2013)","DOI":"10.1007\/978-3-642-38233-8_27"},{"key":"36_CR27","doi-asserted-by":"crossref","unstructured":"Peters, J.: Online elicitation of necessarily optimal matchings. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), vol. 36, pp. 5164\u20135172 (2022)","DOI":"10.1609\/aaai.v36i5.20451"},{"key":"36_CR28","unstructured":"Schulman, L.J., Vazirani, V.V.: Allocation of divisible goods under lexicographic preferences. In: Proceedings of the 35th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (2015)"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: toward a unified measure of complexity. In: Proceedings of the 18th Symposium on Foundations of Computer Science (SFCS), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"},{"key":"36_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.08.003","volume":"934","author":"J Zhang","year":"2022","unstructured":"Zhang, J.: Tight social welfare approximation of probabilistic serial. Theor. Comput. Sci. 934, 1\u20136 (2022)","journal-title":"Theor. Comput. Sci."}],"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-031-48974-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:06:23Z","timestamp":1703988383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","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":"Shanghai","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}