{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:56Z","timestamp":1767338756031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030579791"},{"type":"electronic","value":"9783030579807"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57980-7_5","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"67-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Congestion Games with Priority-Based Scheduling"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Cosimo","family":"Vinci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211\u20131233 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, L.: The price of routing unsplittable flow. In Proceedings of STOC, pp. 57\u201366. ACM (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"5_CR4","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the economics of transportation. Yale University Press, New Haven (1956)"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629666","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: price of anarchy, universal worst-case examples, and tightness. ACM Trans. Econ. Comp. 2(4), 1\u201323 (2014)","journal-title":"ACM Trans. Econ. Comp."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-53354-3_8","volume-title":"Algorithmic Game Theory","author":"V Bil\u00f2","year":"2016","unstructured":"Bil\u00f2, V.: On the robustness of the approximate price of\u00a0anarchy in generalized congestion games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 93\u2013104. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_8"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1007\/s00224-017-9826-1","volume":"62","author":"V Bil\u00f2","year":"2018","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. Theor. Comput. Syst. 62(5), 1288\u20131317 (2018)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00224-010-9309-0","volume":"49","author":"V Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Performances of one-round walks in linear congestion games. Theor. Comput. Syst. 49(1), 24\u201345 (2011)","journal-title":"Theor. Comput. Syst."},{"key":"5_CR9","unstructured":"Bil\u00f2, V., Vinci, C.: On the impact of singleton strategies in congestion games. In: Proceedings of ESA, of LIPIcs, vol. 87, pp. 17:1\u201317:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.tcs.2019.10.012","volume":"806","author":"V Bil\u00f2","year":"2020","unstructured":"Bil\u00f2, V., Vinci, C.: The price of anarchy of affine congestion games with similar strategies. Theor. Comput. Sci. 806, 641\u2013654 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR11","unstructured":"Bil\u00f2, V., Moscardelli, L., Vinci, C.: Uniform mixed equilibria in network congestion games with link failures. In: Proceedings of ICALP, of LIPIcs, vol. 107, pp. 146:1\u2013146:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"5_CR12","unstructured":"Caragiannis, I.: Better bounds for online load balancing on unrelated machines. In: Proceedings of SODA, pp. 972\u2013981. ACM (2008)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica 61(3), 606\u2013637 (2011)","journal-title":"Algorithmica"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-71924-5_6","volume-title":"Web and Internet Economics","author":"I Caragiannis","year":"2017","unstructured":"Caragiannis, I., Gkatzelis, V., Vinci, C.: Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 74\u201387. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_6"},{"issue":"2","key":"5_CR15","first-page":"101","volume":"42","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Gairing, M.: Price of stability in polynomial congestion games. ACM Trans. Econ. Comp. 42(2), 101\u20131017 (2016)","journal-title":"ACM Trans. Econ. Comp."},{"issue":"5","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/18M1207880","volume":"48","author":"G Christodoulou","year":"2019","unstructured":"Christodoulou, G., Gairing, M., Giannakopoulos, Y., Spirakis, P.G.: The price of stability of weighted congestion games. SIAM J. Comput. 48(5), 1544\u20131582 (2019)","journal-title":"SIAM J. Comput."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 59\u201370. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_8"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of STOC, pp. 67\u201373. ACM (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"36","key":"5_CR19","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.02.033","volume":"438","author":"G Christodoulou","year":"2012","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Theor. Comput. Sci. 438, 13\u201327 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V.S., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: Proceedings of STOC, pp. 539\u2013548. ACM (2011)","DOI":"10.1145\/1993636.1993708"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Cominetti, R., Scarsini, M., Schr\u00f6der, M., Stier-Moses, N.E.: Price of anarchy in stochastic atomic congestion games with affine costs. In: Proceedings of EC, pp. 579\u2013580. ACM (2019)","DOI":"10.1145\/3328526.3329579"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Cristi, A., Oosterwijk, T.: On the price of anarchy for flows over time. In: Proceedings of EC, pp. 559\u2013577. ACM (2019)","DOI":"10.1145\/3328526.3329593"},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73B","author":"SC Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J. Res. Natl. Bureau Stand. 73B(2), 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bureau Stand."},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-319-89441-6_23","volume-title":"Approximation and Online Algorithms","author":"J de Jong","year":"2018","unstructured":"de Jong, J., Kern, W., Steenhuisen, B., Uetz, M.: The asymptotic price of anarchy for k-uniform congestion games. In: Solis-Oba, R., Fleischer, R. (eds.) WAOA 2017. LNCS, vol. 10787, pp. 317\u2013328. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89441-6_23"},{"key":"5_CR28","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chicago J. Theor. Comput. Sci., 28 (2008)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Feldman, M., Immorlica, N., Lucier, B., Roughgarden, T., Syrgkanis, V.: The price of anarchy in large games. In: Proceedings of STOC, pp. 963\u2013976. ACM (2016)","DOI":"10.1145\/2897518.2897580"},{"issue":"1\u20133","key":"5_CR30","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2006.07.055","volume":"369","author":"M Gairing","year":"2006","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1\u20133), 116\u2013135 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Schoppmann, F.: Total latency in singleton congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381\u2013387. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_42"},{"issue":"6","key":"5_CR32","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1287\/opre.2016.1512","volume":"64","author":"V Gkatzelis","year":"2016","unstructured":"Gkatzelis, V., Kollias, K., Roughgarden, T.: Optimal cost-sharing in general resource selection games. Oper. Res. 64(6), 1230\u20131238 (2016)","journal-title":"Oper. Res."},{"issue":"4","key":"5_CR33","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/moor.2014.0651","volume":"39","author":"R Gopalakrishnan","year":"2013","unstructured":"Gopalakrishnan, R., Marden, J.R., Wierman, A.: Potential games are necessary to ensure pure nash equilibria in cost sharing games. Math. Oper. Res. 39(4), 1252\u20131296 (2013)","journal-title":"Math. Oper. Res."},{"key":"5_CR34","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Proceedings of the 20th National Conference on Artificial Intelligence, AAAI, pp. 489\u2013494. AAAI Press (2005)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-30473-7_14","volume-title":"Algorithmic Game Theory","author":"M Klimm","year":"2019","unstructured":"Klimm, M., Schmand, D., T\u00f6nnis, A.: The online best reply algorithm for resource allocation problems. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 200\u2013215. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_14"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"issue":"3","key":"5_CR37","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2008.06.045","volume":"406","author":"T L\u00fccking","year":"2008","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. Theor. Comput. Sci. 406(3), 187\u20132006 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR38","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in $$n$$-person games. Proc. Natl. Acad. Sci. 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"5_CR39","first-page":"51","volume":"5","author":"G Piliouras","year":"2016","unstructured":"Piliouras, G., Nikolova, E., Shamma, J.S.: Risk sensitivity of price of anarchy under uncertainty. ACM Trans. Econ. Comp. 5(1), 51\u2013527 (2016)","journal-title":"ACM Trans. Econ. Comp."},{"issue":"1","key":"5_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"5_CR41","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. J. Comput. System Sci. 67(2), 341\u2013364 (2003)","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"5_CR42","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 321\u20133242 (2015)","journal-title":"J. ACM"},{"issue":"2","key":"5_CR43","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR44","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"5_CR45","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2018.06.038","volume":"764","author":"C Vinci","year":"2019","unstructured":"Vinci, C.: Non-atomic one-round walks in congestion games. Theor. Comput. Sci. 764, 61\u201379 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR46","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/moor.1120.0567","volume":"38","author":"P von Falkenhausen","year":"2013","unstructured":"von Falkenhausen, P., Harks, T.: Optimal cost sharing for resource selection games. Math. Oper. Res. 38(1), 184\u2013208 (2013)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57980-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:00:01Z","timestamp":1619240401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","order":11,"name":"conference_url","label":"Conference URL","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"21","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":"0","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":"8","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}