{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:58:06Z","timestamp":1755838686995,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":46,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Tsinghua Initiative Research Program Grant","award":["20151080475"],"award-info":[{"award-number":["20151080475"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186109","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"429-438","source":"Crossref","is-referenced-by-count":4,"title":["When Online Dating Meets Nash Social Welfare"],"prefix":"10.1145","author":[{"given":"Yongzheng","family":"Jia","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Liu","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186109-1","unstructured":"Coffee Meets Bagel. https:\/\/coffeemeetsbagel.com\/."},{"key":"key-10.1145\/3178876.3186109-2","unstructured":"TanTan. https:\/\/tantanapp.com\/en\/."},{"key":"key-10.1145\/3178876.3186109-3","unstructured":"Tinder. https:\/\/www.gotinder.com\/."},{"key":"key-10.1145\/3178876.3186109-4","unstructured":"15% of American Adults Have Used Online Dating Sites or Mobile Dating Apps. Retrived from http:\/\/www.pewinternet.org\/2016\/02\/11\/15-percent-of-american- adults-have-used-online-dating-sites-or-mobile-dating-apps\/, 2016."},{"key":"key-10.1145\/3178876.3186109-5","unstructured":"Marie Claire. Tinder: The Online Dating App Everyone's Talking About . Retrived from http:\/\/www.marieclaire.co.uk\/life\/sex-and-relationships\/tinder-the- online-dating-app-that-everyone-s-talking-about-112522, 2017."},{"key":"key-10.1145\/3178876.3186109-6","unstructured":"Cosmo's Dating App School. Cosmopolitan, 2017."},{"key":"key-10.1145\/3178876.3186109-7","unstructured":"Tantan, China's top dating app, raises $70M for monetization push and overseas expansion. Retrived from https:\/\/techcrunch.com\/2017\/06\/21\/chinas-tantan-raises- 70-million\/, 2017."},{"key":"key-10.1145\/3178876.3186109-8","unstructured":"Maria Zhang. Retrived from http:\/\/tech.gotinder.com\/building-tinder\/. In Tinder Tech Blog: Building Tinder, 2016."},{"key":"key-10.1145\/3178876.3186109-9","doi-asserted-by":"crossref","unstructured":"Günter J. Hitsch, Ali Hortaçsu, and Dan Ariely. What makes you click? mate preferences in online dating. Quantitative marketing and Economics, 2010.","DOI":"10.1007\/s11129-010-9088-6"},{"key":"key-10.1145\/3178876.3186109-10","unstructured":"Medium. Retrived from https:\/\/medium.com\/@worstonlinedater\/tinder- experiments-ii-guys-unless-you-are-really-hot-you-are-probably-better-off-not-wasting-your-2ddf370a6e9a. In Tinder Experiments II: Guys, unless you are really hot you are probably better off not wasting your time on Tinder -- a quantitative socio-economic study, 2015."},{"key":"key-10.1145\/3178876.3186109-11","doi-asserted-by":"crossref","unstructured":"Jessica Strubel and Trent A Petrie. Love me tinder: Body image and psychosocial functioning among men and women. Body Image, 2017.","DOI":"10.1016\/j.bodyim.2017.02.006"},{"key":"key-10.1145\/3178876.3186109-12","doi-asserted-by":"crossref","unstructured":"Gareth Tyson, Vasile C. Perta, Hamed Haddadi, and Michael C. Seto. A first look at user activity on tinder. In Proceedings of IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2016.","DOI":"10.1109\/ASONAM.2016.7752275"},{"key":"key-10.1145\/3178876.3186109-13","doi-asserted-by":"crossref","unstructured":"S. R. Sumter, L. Vandenbosch, and L. Ligtenberg. Love me Tinder: Untangling emerging adults motivations for using the dating application Tinder. Telematics and Informatics, 2017.","DOI":"10.1016\/j.tele.2016.04.009"},{"key":"key-10.1145\/3178876.3186109-14","doi-asserted-by":"crossref","unstructured":"Christopher J. Carpenter and Bree McEwan. The players of micro-dating: Individ- ual and gender differences in goal orientations toward micro-dating apps. First Monday, 2016.","DOI":"10.5210\/fm.v21i5.6187"},{"key":"key-10.1145\/3178876.3186109-15","doi-asserted-by":"crossref","unstructured":"J. Ward. What are you doing on Tinder? impression management on a matchmaking mobile app. Information, Communication & Society, 2016.","DOI":"10.1080\/1369118X.2016.1252412"},{"key":"key-10.1145\/3178876.3186109-16","doi-asserted-by":"crossref","unstructured":"Gábor Orosz, István Tóth-Király, Beáta Bőthe, and Dóra Melher. Too many swipes for today: The development of the problematic tinder use scale. Journal of Behavioral Addictions, 2016.","DOI":"10.1556\/2006.5.2016.016"},{"key":"key-10.1145\/3178876.3186109-17","doi-asserted-by":"crossref","unstructured":"Camille Cobb and Tadayoshi Kohno. How Public Is My Private Life? Privacy in Online Dating. In Proceedings of the 26th International Conference on World Wide Web (WWW), 2017.","DOI":"10.1145\/3038912.3052592"},{"key":"key-10.1145\/3178876.3186109-18","doi-asserted-by":"crossref","unstructured":"Olga Abramova, Annika Baumann, and Hanna Krasnova. Gender differences in online dating: What do we know so far? . In Hawaii International Conference on System Sciences (HICSS), 2016.","DOI":"10.1109\/HICSS.2016.481"},{"key":"key-10.1145\/3178876.3186109-19","unstructured":"Jennie Zhang and Taha Yasseri. What happens after you both swipe right: A statistical description of mobile dating communications. arXiv preprint arXiv:1607.03320, 2016."},{"key":"key-10.1145\/3178876.3186109-20","doi-asserted-by":"crossref","unstructured":"Günter J. Hitsch, Ali Hortaçsu, and Dan Ariely. Matching and Sorting in Online Dating. The American Economic Review, 2010.","DOI":"10.1257\/aer.100.1.130"},{"key":"key-10.1145\/3178876.3186109-21","unstructured":"Jean-Charles Rochet and Jean Tirole. Two-Sided Markets: An Overview. mimeo: MIT, 2004."},{"key":"key-10.1145\/3178876.3186109-22","doi-asserted-by":"crossref","unstructured":"M. Keith Chen. Dynamic Pricing in a Labor Market: Surge Pricing and Flexible Work on the Uber Platform. In Proceedings of the ACM Conference on Economics and Computation, 2016.","DOI":"10.1145\/2940716.2940798"},{"key":"key-10.1145\/3178876.3186109-23","doi-asserted-by":"crossref","unstructured":"Zhixuan Fang, Longbo Huang, and Adam Wierman. Prices and Subsidies in the Sharing Economy. In Proceedings of the 26th International Conference on World Wide Web (WWW), 2017.","DOI":"10.1145\/3038912.3052564"},{"key":"key-10.1145\/3178876.3186109-24","unstructured":"Yongzheng Jia, Wei Xu, and Xue Liu. An Optimization Framework For On- line Ride-sharing Markets. In IEEE International Conference on Distributed Computing Systems (ICDCS), 2017."},{"key":"key-10.1145\/3178876.3186109-25","unstructured":"Google Adwords. https:\/\/adwords.google.com."},{"key":"key-10.1145\/3178876.3186109-26","unstructured":"Aranyak Mehta. Online matching and ad allocation. Foundations and Trends in Theoretical Computer Science, 2013."},{"key":"key-10.1145\/3178876.3186109-27","doi-asserted-by":"crossref","unstructured":"Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, and Cliff Stein. Online Stochastic Packing Applied to Display Ad Allocation. In European Symposium on Algorithms (ESA), 2010.","DOI":"10.1007\/978-3-642-15775-2_16"},{"key":"key-10.1145\/3178876.3186109-28","doi-asserted-by":"crossref","unstructured":"Subhash Khot, Richard J. Lipton, Evangelos Markakis, and Aranyak Mehta. Inap- proximability results for combinatorial auctions with submodular utility functions. In Proceedings of the international conference on Internet and Network Economics (WINE), 2005.","DOI":"10.1007\/11600930_10"},{"key":"key-10.1145\/3178876.3186109-29","doi-asserted-by":"crossref","unstructured":"Vahab Mirrokni, Michael Schapira, and Jan Vondrak. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In Proceedings of the conference on Electronic commerce (EC), 2008.","DOI":"10.1145\/1386790.1386805"},{"key":"key-10.1145\/3178876.3186109-30","doi-asserted-by":"crossref","unstructured":"Jan Vondrak. Optimal approximation for the submodular welfare problem in the value oracle model. In Proceedings of the annual ACM symposium on Theory of computing (STOC), 2008.","DOI":"10.1145\/1374376.1374389"},{"key":"key-10.1145\/3178876.3186109-31","doi-asserted-by":"crossref","unstructured":"Yuval Filmus and Justin Ward. A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2012.","DOI":"10.1109\/FOCS.2012.55"},{"key":"key-10.1145\/3178876.3186109-32","doi-asserted-by":"crossref","unstructured":"Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. In Proceedings of the ACM conference on Electronic Commerce (EC), 2001.","DOI":"10.1145\/501158.501161"},{"key":"key-10.1145\/3178876.3186109-33","doi-asserted-by":"crossref","unstructured":"Michael Kapralov, Ian Post, and Jan Vondrák. Online submodular welfare maxi- mization: Greedy is optimal. In Proceedings of the annual ACM-SIAM symposium on discrete algorithm (SODA), 2013.","DOI":"10.1137\/1.9781611973105.88"},{"key":"key-10.1145\/3178876.3186109-34","doi-asserted-by":"crossref","unstructured":"Nitish Korula, Vahab Mirrokni, and Morteza. Online submodular welfare maxi- mization: Greedy beats 1\/2 in random order. In Proceedings of the annual ACM symposium on Theory of computing (STOC), 2015.","DOI":"10.1145\/2746539.2746626"},{"key":"key-10.1145\/3178876.3186109-35","doi-asserted-by":"crossref","unstructured":"John Nash. The Bargaining Problem. Econometrica 18, 2, 1950.","DOI":"10.2307\/1907266"},{"key":"key-10.1145\/3178876.3186109-36","doi-asserted-by":"crossref","unstructured":"Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of maximum nash welfare. In Proceedings of the ACM Conference on Economics and Computation (EC), 2016.","DOI":"10.1145\/2940716.2940726"},{"key":"key-10.1145\/3178876.3186109-37","doi-asserted-by":"crossref","unstructured":"Euiwoong Lee. APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items. Information Processing Letters 122, 17--20, 2017.","DOI":"10.1016\/j.ipl.2017.01.012"},{"key":"key-10.1145\/3178876.3186109-38","doi-asserted-by":"crossref","unstructured":"Simina Branzei, Vasilis Gkatzelis, and Ruta Mehta. Nash social welfare approxi- mation for strategic agents. In Proceedings of the ACM Conference on Economics and Computation (EC), 2017.","DOI":"10.1145\/3033274.3085143"},{"key":"key-10.1145\/3178876.3186109-39","doi-asserted-by":"crossref","unstructured":"Richard Cole and Vasilis Gkatzelis. Approximating the nash social welfare with indivisible items. In Proceedings of the annual ACM symposium on Theory of computing, 2015.","DOI":"10.1145\/2746539.2746589"},{"key":"key-10.1145\/3178876.3186109-40","unstructured":"Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Approximating the nash social welfare with budget-additive valuations. In Arxiv: 1707.04428v1, 2017."},{"key":"key-10.1145\/3178876.3186109-41","unstructured":"Siddharth Barman, Sanath Kumar Krishnamurthy, and Rohit Vaish. Finding fair and efficient allocations. In Arxiv: 1707.04731, 2017."},{"key":"key-10.1145\/3178876.3186109-42","doi-asserted-by":"crossref","unstructured":"Sara Ramezani and Ulle Endriss. Nash Social Welfare in Multiagent Resource Allocation. Lecture Notes in Business Information Processing, 2010.","DOI":"10.1007\/978-3-642-15117-0_9"},{"key":"key-10.1145\/3178876.3186109-43","doi-asserted-by":"crossref","unstructured":"Hervé Moulin. Fair Division and Collective Welfare. Public Choice, 2004.","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"key-10.1145\/3178876.3186109-44","doi-asserted-by":"crossref","unstructured":"Edmund Eisenberg and David Gale. Consensus of Subjective Probabilities: The Pari-Mutuel Method. The Annals of Mathematical Statistics 30, 1, 1959.","DOI":"10.1214\/aoms\/1177706369"},{"key":"key-10.1145\/3178876.3186109-45","doi-asserted-by":"crossref","unstructured":"Tian Lan, David Kao, Mung Chiang, and Ashutosh Sabharwal. An axiomatic theory of fairness in network resource allocation. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), 2010.","DOI":"10.1109\/INFCOM.2010.5461911"},{"key":"key-10.1145\/3178876.3186109-46","doi-asserted-by":"crossref","unstructured":"Vinod Thomas, Yan Wang, and Xibo Fan. Measuring education inequality : Gini coefficients of education. Policy Research Working Papers, 2001.","DOI":"10.1596\/1813-9450-2525"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186109&ftid=1957531&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:25:38Z","timestamp":1751563538000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186109"}},"subtitle":["Achieving Efficiency and Fairness"],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186109","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}