{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:33Z","timestamp":1760202633969,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,5]],"date-time":"2011-06-05T00:00:00Z","timestamp":1307232000000},"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,5]]},"DOI":"10.1145\/1993574.1993618","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"285-294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal cost sharing protocols for scheduling games"],"prefix":"10.1145","author":[{"given":"Philipp","family":"von Falkenhausen","sequence":"first","affiliation":[{"name":"Berlin Institute of Technology, Berlin, Germany"}]},{"given":"Tobias","family":"Harks","sequence":"additional","affiliation":[{"name":"Berlin Institute of Technology, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.035"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680096"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882123.1882127"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496859"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9128-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/08072721X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_31"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0098"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273348"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684270"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_44"},{"key":"e_1_3_2_1_15_1","first-page":"489","volume-title":"Proc. AAAI","author":"Ieong S.","year":"2005","unstructured":"S. Ieong , R. McGrew , E. Nudelman , Y. Shoham , and Q. Sun . Fast and compact: A simple class of congestion games . In Proc. AAAI , pages 489 -- 494 , 2005 . S. Ieong, R. McGrew, E. Nudelman, Y. Shoham, and Q. Sun. Fast and compact: A simple class of congestion games. In Proc. AAAI, pages 489--494, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.032"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0027"},{"key":"e_1_3_2_1_19_1","volume-title":"A Course in Game Theory","author":"Osborne M.","year":"1994","unstructured":"M. Osborne and A. Rubinstein . A Course in Game Theory . MIT Press , 1994 . M. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00044-8"},{"key":"e_1_3_2_1_22_1","volume-title":"Selfish Routing and the Price of Anarchy","author":"Roughgarden T.","year":"2005","unstructured":"T. Roughgarden . Selfish Routing and the Price of Anarchy . The MIT Press , 2005 . T. Roughgarden. Selfish Routing and the Price of Anarchy. The MIT Press, 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_3_2_1_24_1","volume-title":"Birkh\u00e4user Boston","author":"Srikant R.","year":"2003","unstructured":"R. Srikant . The Mathematics of Internet Congestion Control . Birkh\u00e4user Boston , 2003 . R. Srikant. The Mathematics of Internet Congestion Control. Birkh\u00e4user Boston, 2003."}],"event":{"name":"EC '11: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"San Jose California USA","acronym":"EC '11"},"container-title":["Proceedings of the 12th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993618","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993574.1993618","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\/1993574.1993618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,5]]},"references-count":24,"alternative-id":["10.1145\/1993574.1993618","10.1145\/1993574"],"URL":"https:\/\/doi.org\/10.1145\/1993574.1993618","relation":{},"subject":[],"published":{"date-parts":[[2011,6,5]]},"assertion":[{"value":"2011-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}