{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:52Z","timestamp":1759637632653,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374388","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"57-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Interdomain routing and games"],"prefix":"10.1145","author":[{"given":"Hagay","family":"Levin","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"given":"Aviv","family":"Zohar","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2006.65"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of ACM-SIAM Symposium on Discrete Algorithms","author":"Fabrikant Alex","year":"2008","unstructured":"Alex Fabrikant and Christos Papadimitriou . The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond . In Proceedings of ACM-SIAM Symposium on Discrete Algorithms , 2008 . Alex Fabrikant and Christos Papadimitriou. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080096"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.020"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0122-y"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134722"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0134-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296179"},{"key":"e_1_3_2_1_11_1","first-page":"547","volume-title":"Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001","author":"Gao Lixin","year":"2001","unstructured":"Lixin Gao , Timothy G. Griffin , and Jennifer Rexford . Inherently safe backup routing with BGP . In Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001 ), pages 547 -- 556 , 2001 . Lixin Gao, Timothy G. Griffin, and Jennifer Rexford. Inherently safe backup routing with BGP. In Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pages 547--556, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863964"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/850936.852486"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316231"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781894.1781922"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250843"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_19_1","volume-title":"Internet Global Summit (INET)","author":"Huston Geoff","year":"1999","unstructured":"Geoff Huston . Interconnection , peering, and settlements . In Internet Global Summit (INET) . The Internet Society , 1999 . Geoff Huston. Interconnection, peering, and settlements. In Internet Global Summit (INET). The Internet Society, 1999."},{"key":"e_1_3_2_1_20_1","volume-title":"The strategic justification for BGP. Technical report","author":"Levin Hagay","year":"2006","unstructured":"Hagay Levin , Michael Schapira , and Aviv Zohar . The strategic justification for BGP. Technical report , The Leibniz Center,The Hebrew University of Jerusalem , 2006 . Hagay Levin, Michael Schapira, and Aviv Zohar. The strategic justification for BGP. Technical report, The Leibniz Center,The Hebrew University of Jerusalem, 2006."},{"key":"e_1_3_2_1_21_1","first-page":"1143","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2007","author":"Mu\u2019alem Ahuva","year":"2007","unstructured":"Ahuva Mu\u2019alem and Michael Schapira . Setting lower bounds on truthfulness . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2007 ), pages 1143 -- 1152 . Society for Industrial and Applied Mathematics , 2007 . Ahuva Mu\u2019alem and Michael Schapira. Setting lower bounds on truthfulness. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2007), pages 1143--1152. Society for Industrial and Applied Mathematics, 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011781"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857111"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00108-5"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":23,"alternative-id":["10.1145\/1374376.1374388","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374388","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}