{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:48:09Z","timestamp":1763466489390,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993666","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"215-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Dueling algorithms"],"prefix":"10.1145","author":[{"given":"Nicole","family":"Immorlica","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, USA"}]},{"given":"Adam Tauman","family":"Kalai","sequence":"additional","affiliation":[{"name":"MSR New England, Cambridge, USA"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}]},{"given":"Ankur","family":"Moitra","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, USA"}]},{"given":"Andrew","family":"Postlewaite","sequence":"additional","affiliation":[{"name":"UPenn, Philadelphia, USA"}]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[{"name":"Microsoft R&D Israel and the Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_73"},{"key":"e_1_3_2_2_2_1","volume-title":"AAAI","author":"Ashlagi Itai","year":"2010","unstructured":"Itai Ashlagi , Moshe Tennenholtz , and Aviv Zohar . Competing schedulers . In AAAI , 2010 . Itai Ashlagi, Moshe Tennenholtz, and Aviv Zohar. Competing schedulers. In AAAI, 2010."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.10.008"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-2354.00013"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/829497.829790"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.18"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_35"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.339"},{"key":"e_1_3_2_2_12_1","first-page":"29","article-title":"Matching theory","author":"Lov\u00e1sz L.","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer . Matching theory . Ann. Discrete Math. , 29 , 1986 . L. Lov\u00e1sz and M. D. Plummer. Matching theory. Ann. Discrete Math., 29, 1986.","journal-title":"Ann. Discrete Math."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/2951643"},{"issue":"2","key":"e_1_3_2_2_14_1","first-page":"255","article-title":"K-price auctions: Revenue Inequalities, Utility Equivalence, and Competition","volume":"24","author":"Monderer D.","year":"2004","unstructured":"D. Monderer and M. Tennenholtz . K-price auctions: Revenue Inequalities, Utility Equivalence, and Competition in Auction Design. Economic Theory , 24 ( 2 ): 255 -- 270 , 2004 . D. Monderer and M. Tennenholtz. K-price auctions: Revenue Inequalities, Utility Equivalence, and Competition in Auction Design. Economic Theory, 24(2):255--270, 2004.","journal-title":"Auction Design. Economic Theory"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1997.2278"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"STOC'11"},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993666","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":15,"alternative-id":["10.1145\/1993636.1993666","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993666","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}