{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:45Z","timestamp":1759638945940,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T00:00:00Z","timestamp":1469059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Italian Ministry of University","award":["PRIN 2010--2011 research project ARS TechnoMedia"],"award-info":[{"award-number":["PRIN 2010--2011 research project ARS TechnoMedia"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,21]]},"DOI":"10.1145\/2940716.2940750","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T15:20:09Z","timestamp":1469114409000},"page":"839-856","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Dynamic Taxes for Polynomial Congestion Games"],"prefix":"10.1145","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[{"name":"University of Salento, Lecce, Italy"}]},{"given":"Cosimo","family":"Vinci","sequence":"additional","affiliation":[{"name":"Gran Sasso Science Institute, L'Aquila, Italy"}]}],"member":"320","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455248.1455249"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/090748986"},{"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.1145\/2764468.2764497"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629666"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA) (LNCS)","volume":"7846","author":"Bil\u00f2 V.","year":"2012","unstructured":"V. Bil\u00f2 . 2012 . A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games . In Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA) (LNCS) , Vol. 7846 . Springer, 229--241. V. Bil\u00f2. 2012. A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA) (LNCS), Vol. 7846. Springer, 229--241."},{"key":"e_1_3_2_1_8_1","volume-title":"On the robustness of the approximate price of anarchy in generalized congestion games. CoRR abs\/1412.0845","author":"Bil\u00f2 V.","year":"2014","unstructured":"V. Bil\u00f2 . 2014. On the robustness of the approximate price of anarchy in generalized congestion games. CoRR abs\/1412.0845 ( 2014 ). V. Bil\u00f2. 2014. On the robustness of the approximate price of anarchy in generalized congestion games. CoRR abs\/1412.0845 (2014)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9309-0"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48995-6_10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe. 2004. Convex optimization. Cambridge.   S. Boyd and L. Vandenberghe. 2004. Convex optimization. Cambridge.","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2614687"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9427-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868251"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_33"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.005"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2003591.2003599"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.09.010"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9152-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_13"},{"volume-title":"Proceedings of the 3rd International Conference on Internet and Network Economics (WINE'07)","author":"Fotakis D.","key":"e_1_3_2_1_23_1","unstructured":"D. Fotakis and P. G. Spirakis . 2007.Cost-balancing Tolls for Atomic Network Congestion Games . In Proceedings of the 3rd International Conference on Internet and Network Economics (WINE'07) . Springer-Verlag, 179--190. D. Fotakis and P. G. Spirakis. 2007.Cost-balancing Tolls for Atomic Network Congestion Games. In Proceedings of the 3rd International Conference on Internet and Network Economics (WINE'07). Springer-Verlag, 179--190."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.055"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0543"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9315-x"},{"key":"e_1_3_2_1_27_1","unstructured":"T. Jelinek M. Klaas and G. Schafer. 2014. Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (Leibniz International Proceedings in Informatics (LIPIcs)) Vol. 25. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 433--444.  T. Jelinek M. Klaas and G. Schafer. 2014. Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (Leibniz International Proceedings in Informatics (LIPIcs)) Vol. 25. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 433--444."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS) (LNCS)","volume":"1653","author":"Koutsoupias E.","unstructured":"E. Koutsoupias and C. Papadimitriou . 1999. Worst-case equilibria . In Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS) (LNCS) , Vol. 1653 . Springer, 404--413. E. Koutsoupias and C. Papadimitriou. 1999. Worst-case equilibria. In Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS) (LNCS), Vol. 1653. Springer, 404--413."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.045"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"T. Mansour and M. Schork. 2015. Commutation relations normal ordering and Stirling numbers. CRC Press.  T. Mansour and M. Schork. 2015. Commutation relations normal ordering and Stirling numbers. CRC Press.","DOI":"10.1201\/b18869"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847242"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (LNCS)","volume":"3122","author":"Mirrokni V. S.","unstructured":"V. S. Mirrokni and A. Vetta . 2004. Convergence issues in competitive games . In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (LNCS) , Vol. 3122 . Springer, 183--194. V. S. Mirrokni and A. Vetta. 2004. Convergence issues in competitive games. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (LNCS), Vol. 3122. Springer, 183--194."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0292"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1216584"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379762"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209249.2209274"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.09.005"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118733.3118816"}],"event":{"name":"EC '16: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Maastricht The Netherlands","acronym":"EC '16"},"container-title":["Proceedings of the 2016 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940750","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:27Z","timestamp":1750222587000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,21]]},"references-count":40,"alternative-id":["10.1145\/2940716.2940750","10.1145\/2940716"],"URL":"https:\/\/doi.org\/10.1145\/2940716.2940750","relation":{},"subject":[],"published":{"date-parts":[[2016,7,21]]},"assertion":[{"value":"2016-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}