{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:39:04Z","timestamp":1782970744426,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030304720","type":"print"},{"value":"9783030304737","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_24","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"357-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stochastic Matching on Uniformly Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Soheil","family":"Behnezhad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahsa","family":"Derakhshan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alireza","family":"Farhadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nima","family":"Reyhani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Akbarpour, M., Li, S., Gharan, S.O.: Dynamic matching market design. In: ACM Conference on Economics and Computation, EC 2014, Stanford, CA, USA, 8\u201312 June 2014, p. 355 (2014). https:\/\/doi.org\/10.1145\/2600057.2602887","DOI":"10.1145\/2600057.2602887"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, R., Ashlagi, I., Gamarnik, D., Kanoria, Y.: A dynamic model of Barter exchange. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 1925\u20131933 (2015a). https:\/\/doi.org\/10.1137\/1.9781611973730.129","DOI":"10.1137\/1.9781611973730.129"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1073\/pnas.1421853112","volume":"112","author":"Ross Anderson","year":"2015","unstructured":"Anderson, R., Ashlagi, I., Gamarnik, D., Roth, A.E.: Finding long chains in kidney exchange using the traveling salesman problem. Proc. Natl. Acad. Sci. 112(3), 663\u2013668 (2015b)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"24_CR4","unstructured":"Assadi, S., Bernstein, A.: Towards a unified theory of sparsification for matching problems. In: 2nd Symposium on Simplicity in Algorithms, SOSA@SODA, San Diego, CA, USA (OASICS), 8\u20139 January 2019 (2019)"},{"key":"24_CR5","unstructured":"Fineman, J.T., Mitzenmacher, M. (eds.) Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 69, pp. 11:1\u201311:20 (2019). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.11"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem with (very) few queries. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, Maastricht, The Netherlands, 24\u201328 July 2016, pp. 43\u201360 (2016). https:\/\/doi.org\/10.1145\/2940716.2940769","DOI":"10.1145\/2940716.2940769"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem: beating half with a non-adaptive algorithm. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, Cambridge, MA, USA, 26\u201330 June 2017, pp. 99\u2013116 (2017). https:\/\/doi.org\/10.1145\/3033274.3085146","DOI":"10.1145\/3033274.3085146"},{"key":"24_CR8","unstructured":"Awasthi, P., Sandholm,T.: Online stochastic optimization in the large: application to kidney exchange. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, pp. 405\u2013411 (2009). http:\/\/ijcai.org\/Proceedings\/09\/Papers\/075.pdf"},{"issue":"543","key":"24_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(543), 509\u2013512 (1999)","journal-title":"Science"},{"key":"24_CR10","unstructured":"Basu, C., Hirsh, H., Cohen, W.W.: Recommendation as classification: using social and content-based information in recommendation. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI 1998, IAAI 1998, Madison, Wisconsin, USA, 26\u201330 July 1998, pp. 714\u2013720 (1998). http:\/\/www.aaai.org\/Library\/AAAI\/1998\/aaai98-101.php"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"2855","DOI":"10.1137\/1.9781611975482.177","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Soheil Behnezhad","year":"2019","unstructured":"Behnezhad, S., Farhadi, A., Hajiaghayi, M.T., Reyhani, N.: Stochastic matching with few queries: new algorithms and tools. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January 2019, pp. 2855\u20132874 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.177"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Reyhani, N.: Almost optimal stochastic weighted matching with few queries (2018)","DOI":"10.1145\/3219166.3219226"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Blum, A., Dickerson, J.P., Haghtalab, N., Procaccia, A.D.., Sandholm, T., Sharma, A.: Ignorance is almost bliss: near-optimal stochastic matching with few queries. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC 2015, Portland, OR, USA, 15\u201319 June 2015, pp. 325\u2013342 (2015). https:\/\/doi.org\/10.1145\/2764468.2764479","DOI":"10.1145\/2764468.2764479"},{"issue":"12","key":"24_CR14","doi-asserted-by":"publisher","first-page":"10990","DOI":"10.1016\/j.eswa.2012.03.025","volume":"39","author":"Walter Carrer-Neto","year":"2012","unstructured":"Carrer-Neto, W., Hern\u00e1ndez-Alcaraz, M.L., Valencia-Garc\u00eda, R., S\u00e1nchez, F.G.: Social knowledge-based recommender system. Application to the movies domain. Expert Syst. Appl. 39(12), 10990\u201311000 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2012.03.025","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1016\/j.chb.2010.09.012","volume":"27","author":"Rub\u00e9n Gonz\u00e1lez Crespo","year":"2011","unstructured":"Crespo, R.G., et al.: Recommendation System based on user interaction data applied to intelligent electronic books. Comput. Hum. Behav. 27(4), 1445\u20131449 (2011). https:\/\/doi.org\/10.1016\/j.chb.2010.09.012","journal-title":"Computers in Human Behavior"},{"key":"24_CR16","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Dynamic matching via weighted myopia with application to kidney exchange. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, Ontario, Canada, 22\u201326 July 2012 (2012). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/5031"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Failure-aware kidney exchange. In: ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, 16\u201320 June 2013, pp. 323\u2013340 (2013). https:\/\/doi.org\/10.1145\/2482540.2482596","DOI":"10.1145\/2492002.2482596"},{"key":"24_CR18","unstructured":"Dickerson, J.P., Sandholm, T.: FutureMatch: combining human value judgments and machine learning to match in dynamic environments. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA, 25\u201330 January 2015, pp. 622\u2013628 (2015). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9497"},{"issue":"11","key":"24_CR19","doi-asserted-by":"publisher","first-page":"2142","DOI":"10.1016\/j.ins.2010.02.004","volume":"180","author":"Seok Kee Lee","year":"2010","unstructured":"Lee, S.K., Cho, Y.H., Kim, S.H.: Collaborative filtering with ordinal scale-based implicit ratings for mobile music recommendations. Inf. Sci. 180(11), 2142\u20132155 (2010). https:\/\/doi.org\/10.1016\/j.ins.2010.02.004","journal-title":"Information Sciences"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Maehara, T., Yamaguchi, Y.: Stochastic packing integer programs with few queries. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2018)","DOI":"10.1137\/1.9781611975031.21"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"1.1-1.21","DOI":"10.1145\/2670129","volume":"19","author":"David F. Manlove","year":"2015","unstructured":"Manlove, D.F., O\u2019Malley, G.: Paired and altruistic kidney donation in the UK: algorithms and experimentation. ACM J. Exp. Algorithmics 19(1) (2014). https:\/\/doi.org\/10.1145\/2670129","journal-title":"Journal of Experimental Algorithmics"},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/TASL.2009.2033973","volume":"18","author":"A. Nanopoulos","year":"2010","unstructured":"Nanopoulos, A., Rafailidis, D., Symeonidis, P., Manolopoulos, Y.: Musicbox: personalized music recommendation based on cubic analysis of social tags. IEEE Trans. Audio Speech Lang. Process. 18(2), 407\u2013412 (2010)","journal-title":"IEEE Transactions on Audio, Speech, and Language Processing"},{"issue":"4","key":"24_CR23","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1016\/j.chb.2012.02.001","volume":"28","author":"Edward Rolando N\u00fa\u00f1ez-Vald\u00e9z","year":"2012","unstructured":"N\u00fa\u00f1ez-Vald\u00e9z, E.R., Lovelle, J.M.C., Mart\u00ednez, O.S., Garc\u00eda-D\u00edaz, V., de Pablos, P.O., Mar\u00edn, C.E.M.: Implicit feedback techniques on recommender systems applied to electronic books. Comput. Hum. Behav. 28(4), 1186\u20131193 (2012). https:\/\/doi.org\/10.1016\/j.chb.2012.02.001","journal-title":"Computers in Human Behavior"},{"issue":"1","key":"24_CR24","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.knosys.2009.07.007","volume":"23","author":"C. Porcel","year":"2010","unstructured":"Porcel, C., Herrera-Viedma, E.: Dealing with incomplete information in a fuzzy linguistic recommender system to disseminate information in university digital libraries. Knowl.-Based Syst. 23(1), 32\u201339 (2010). https:\/\/doi.org\/10.1016\/j.knosys.2009.07.007","journal-title":"Knowledge-Based Systems"},{"issue":"10","key":"24_CR25","doi-asserted-by":"publisher","first-page":"12520","DOI":"10.1016\/j.eswa.2009.04.038","volume":"36","author":"C. Porcel","year":"2009","unstructured":"Porcel, C., Moreno, J.M., Herrera-Viedma, E.: A multi-disciplinar recommender system to advice research resources in University Digital Libraries. Expert Syst. Appl. 36(10), 12520\u201312528 (2009). https:\/\/doi.org\/10.1016\/j.eswa.2009.04.038","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"24_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2011.08.026","volume":"184","author":"C. Porcel","year":"2012","unstructured":"Porcel, C., Tejeda-Lorente, \u00c1., Mart\u00ednez, M.A., Herrera-Viedma, E.: A hybrid recommender system for the selective dissemination of research resources in a Technology Transfer Office. Inf. Sci. 184(1), 1\u201319 (2012). https:\/\/doi.org\/10.1016\/j.ins.2011.08.026","journal-title":"Information Sciences"},{"issue":"9","key":"24_CR27","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.ins.2011.01.012","volume":"181","author":"Jesus Serrano-Guerrero","year":"2011","unstructured":"Serrano-Guerrero, J., Herrera-Viedma, E., Olivas, J.A., Cerezo, A., Romero, F.P.: A Google wave-based fuzzy recommender system to disseminate information in University Digital Libraries 2.0. Inf. Sci. 181(9), 1503\u20131516 (2011). https:\/\/doi.org\/10.1016\/j.ins.2011.01.012","journal-title":"Information Sciences"},{"key":"24_CR28","unstructured":"Solomon, S.: Local algorithms for bounded degree sparsifiers in sparse graphs. In: 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, Cambridge, MA, USA, 11\u201314 January 2018, pp. 52:1\u201352:19. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.52"},{"key":"24_CR29","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-0-85729-436-4_10","volume-title":"Social Media Modeling and Computing","author":"Shulong Tan","year":"2011","unstructured":"Tan, S., Bu, J., Chen, C., He, X.: Using rich social media information for music recommendation via hypergraph model. In: Hoi, S., Luo, J., Boll, S., Xu, D., Jin, R., King, I. (eds.) Social Media Modeling and Computing, pp. 213\u2013237 (2011). https:\/\/doi.org\/10.1007\/978-0-85729-436-4_10"},{"issue":"1","key":"24_CR30","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1111\/j.1467-937X.2009.00575.x","volume":"77","author":"M. UTKU \u00dcNVER","year":"2009","unstructured":"Utku \u00dcnver, M.: Dynamic kidney exchange. Rev. Econ. Stud. 77(1), 372\u2013414 (2010)","journal-title":"Review of Economic Studies"},{"issue":"8","key":"24_CR31","doi-asserted-by":"publisher","first-page":"6086","DOI":"10.1016\/j.eswa.2010.02.117","volume":"37","author":"Pinata Winoto","year":"2010","unstructured":"Winoto, P., Tang, T.Y.: The role of user mood in movie recommendations. Expert Syst. Appl. 37(8), 6086\u20136092 (2010). https:\/\/doi.org\/10.1016\/j.eswa.2010.02.117","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"24_CR32","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s11257-006-9005-6","volume":"16","author":"Zhiwen Yu","year":"2006","unstructured":"Yu, Z., Zhou, X., Hao, Y., Gu, J.: TV program recommendation for multiple viewers based on user profile merging. User Model. User-Adapt. Interact. 16(1), 63\u201382 (2006). https:\/\/doi.org\/10.1007\/s11257-006-9005-6","journal-title":"User Modeling and User-Adapted Interaction"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:35:23Z","timestamp":1709811323000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"55","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":"26","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":"47% - 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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}