{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:37Z","timestamp":1742913757049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031158384"},{"type":"electronic","value":"9783031158391"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15839-1_11","type":"book-chapter","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T18:02:38Z","timestamp":1661709758000},"page":"183-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-blind Strategies in\u00a0Timed Network Congestion Games"],"prefix":"10.1007","author":[{"given":"Aline","family":"Goeminne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"11_CR1","unstructured":"Almagor, S., Alur, R., Bansal, S.: Equilibria in quantitative concurrent games (2018)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Altman, E., Kumar, A., Hayel, Y.: A potential game approach for uplink resource allocation in a multichannel wireless access network. In: Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools, pp. 1\u20139 (2009)","DOI":"10.4108\/ICST.VALUETOOLS2009.8036"},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002). https:\/\/doi.org\/10.1145\/585265.585270","journal-title":"J. ACM"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS 2004), pp. 295\u2013304. IEEE Computer Society Press, October 2004. https:\/\/doi.org\/10.1109\/FOCS.2004.68","DOI":"10.1109\/FOCS.2004.68"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Avni, G., Guha, S., Kupferman, O.: Timed network games. In: Larsen, K.G., Bodlaender, H.L., Raskin, J.F. (eds.) Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics, vol. 84, pp. 37:1\u201337:16. Leibniz-Zentrum f\u00fcr Informatik, August 2017. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2017.37","DOI":"10.4230\/LIPIcs.MFCS.2017.37"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Avni, G., Guha, S., Kupferman, O.: Timed network games with clocks. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics, vol. 117, pp. 23:1\u201323:18. Leibniz-Zentrum f\u00fcr Informatik (Aug 2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.23","DOI":"10.4230\/LIPIcs.MFCS.2018.23"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 57\u201366. Association for Computing Machinery, New York (2005). https:\/\/doi.org\/10.1145\/1060590.1060599","DOI":"10.1145\/1060590.1060599"},{"key":"11_CR8","unstructured":"Bertrand, N., Markey, N., Sadhukhan, S., Sankur, O.: Dynamic network congestion games. In: Saxena, N., Simon, S. (eds.) FSTTCS 2020. LIPIcs, vol. 182, pp. 40:1\u201340:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.geb.2013.09.004","volume":"92","author":"U Bhaskar","year":"2015","unstructured":"Bhaskar, U., Fleischer, L., Anshelevich, E.: A stackelberg strategy for routing flow over time. Games Econ. Behav. 92, 232\u2013247 (2015). https:\/\/doi.org\/10.1016\/j.geb.2013.09.004","journal-title":"Games Econ. Behav."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 67\u201373. Association for Computing Machinery, New York (2005). https:\/\/doi.org\/10.1145\/1060590.1060600","DOI":"10.1145\/1060590.1060600"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Goeminne, A., Markey, N., Sankur, O.: Non-blind strategies in timed network congestion games. Technical report (2022). arXiv:2207.01537","DOI":"10.1007\/978-3-031-15839-1_11"},{"issue":"39","key":"11_CR12","doi-asserted-by":"publisher","first-page":"5420","DOI":"10.1016\/j.tcs.2011.05.055","volume":"412","author":"M Hoefer","year":"2011","unstructured":"Hoefer, M., Mirrokni, V.S., R\u00f6glin, H., Teng, S.H.: Competitive routing over time. Theoret. Comput. Sci. 412(39), 5420\u20135432 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.055","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-28332-1_31","volume-title":"Language and Automata Theory and Applications","author":"M Klimo\u0161","year":"2012","unstructured":"Klimo\u0161, M., Larsen, K.G., \u0160tefa\u0148\u00e1k, F., Thaarup, J.: Nash equilibria in concurrent priced games. In: Dediu, A.H., Mart\u00edn-Vide, C. (eds.) Language and Automata Theory and Applications, pp. 363\u2013376. Springer, Heidelberg (2012)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00224-010-9299-y","volume":"49","author":"R Koch","year":"2011","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theory Comput. Syst. 49(1), 71\u201397 (2011). https:\/\/doi.org\/10.1007\/s00224-010-9299-y","journal-title":"Theory Comput. Syst."},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009). https:\/\/doi.org\/10.1016\/j.cosrev.2009.04.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1574013709000203","DOI":"10.1016\/j.cosrev.2009.04.003"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-642-31585-5_55","volume-title":"Automata, Languages, and Programming","author":"E Koutsoupias","year":"2012","unstructured":"Koutsoupias, E., Papakonstantinopoulou, K.: Contention issues in congestion games. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 623\u2013635. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_55"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996). https:\/\/doi.org\/10.1006\/game.1996.0044","journal-title":"Games Econ. Behav."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)","DOI":"10.1017\/CBO9780511800481"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1287\/moor.1090.0394","volume":"34","author":"M Penn","year":"2009","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Random order congestion games. Math. Oper. Res. 34(3), 706\u2013725 (2009). https:\/\/doi.org\/10.1287\/moor.1090.0394","journal-title":"Math. Oper. Res."},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TNET.2006.880179","volume":"14","author":"L Qiu","year":"2006","unstructured":"Qiu, L., Yang, R., Zhang, Y., Shenker, S.: On selfish routing in internet-like environments. IEEE Trans. Comput. 14(4), 725\u2013738 (2006). https:\/\/doi.org\/10.1109\/TNET.2006.880179","journal-title":"IEEE Trans. Comput."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3, 53\u201359 (1973)","journal-title":"Networks"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Routing games. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.) Algorithmic Game Theory, chap. 18, pp. 461\u2013486. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.020"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15839-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T23:16:01Z","timestamp":1662074161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15839-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158384","9783031158391"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15839-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}