{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:06Z","timestamp":1740099606040,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349790"},{"type":"electronic","value":"9783030349806"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-34980-6_1","type":"book-chapter","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T06:03:07Z","timestamp":1573452187000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7885-3917","authenticated-orcid":false,"given":"Julian","family":"Nickerl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"issue":"5","key":"1_CR1","first-page":"446","volume":"82","author":"R Arnott","year":"1994","unstructured":"Arnott, R., Small, K.: The economics of traffic congestion. Am. Sci. 82(5), 446\u2013455 (1994)","journal-title":"Am. Sci."},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10898-010-9527-7","volume":"48","author":"L Bai","year":"2010","unstructured":"Bai, L., Hearn, D.W., Lawphongpanich, S.: A heuristic method for the minimum toll booth problem. J. Global Optim. 48(4), 533\u2013548 (2010)","journal-title":"J. Global Optim."},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1287\/opre.1090.0694","volume":"57","author":"L Bai","year":"2009","unstructured":"Bai, L., Rubin, P.A.: Combinatorial benders cuts for the minimum tollbooth problem. Oper. Res. 57(6), 1510\u20131522 (2009)","journal-title":"Oper. Res."},{"issue":"2","key":"1_CR4","first-page":"33","volume":"11","author":"L Bai","year":"2008","unstructured":"Bai, L., Stamps, M.T., Harwood, R.C., Kollmann, C.J.: An evolutionary method for the minimum toll booth problem: the methodology. J. Manage. Inf. Decis. Sci. 11(2), 33 (2008)","journal-title":"J. Manage. Inf. Decis. Sci."},{"issue":"5439","key":"1_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"Albert-L\u00e1szl\u00f3 Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-662-48995-6_7","volume-title":"Web and Internet Economics","author":"S Basu","year":"2015","unstructured":"Basu, S., Lianeas, T., Nikolova, E.: New complexity results and algorithms for the minimum tollbooth problem. In: Markakis, E., Sch\u00e4fer, G. (eds.) WINE 2015. LNCS, vol. 9470, pp. 89\u2013103. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48995-6_7"},{"key":"1_CR7","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-24829-0_27","volume-title":"Algorithmic Game Theory","author":"V Bonifaci","year":"2011","unstructured":"Bonifaci, V., Salek, M., Sch\u00e4fer, G.: Efficiency of restricted tolls in non-atomic network routing games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 302\u2013313. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24829-0_27"},{"key":"1_CR9","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"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proceedings of STOC, pp. 521\u2013530. ACM (2003)","DOI":"10.1145\/780542.780618"},{"key":"1_CR11","unstructured":"Colini-Baldeschi, R., Klimm, M., Scarsini, M.: Demand-independent optimal tolls. arXiv preprint arXiv:1708.02737 (2017)"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs i. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"1_CR13","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proceedings of FOCS, pp. 277\u2013285. IEEE (2004)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956). https:\/\/doi.org\/10.4153\/CJM-1956-045-5","journal-title":"Canadian Journal of Mathematics"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1002\/net.21604","volume":"65","author":"T Harks","year":"2015","unstructured":"Harks, T., Kleinert, I., Klimm, M., M\u00f6hring, R.H.: Computing network tolls with support constraints. Networks 65(3), 262\u2013285 (2015)","journal-title":"Networks"},{"key":"1_CR16","unstructured":"Harwood, R.C., Kollmann, C.J., Stamps, M.T.: A genetic algorithm for the minimum tollbooth problem (2005)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-1-4615-5757-9_6","volume-title":"Equilibrium and Advanced Transportation Modelling","author":"Donald W. Hearn","year":"1998","unstructured":"Hearn, D.W., Ramana, M.V.: Solving congestion toll pricing models. In: Marcotte, P., Nguyen, S. (eds.) Equilibrium and Advanced Transportation Modelling. Centre for Research on Transportation, pp. 109\u2013124. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5757-9_6"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-030-04648-4_10","volume-title":"Computational Data and Social Networks","author":"P Kr\u00f6mer","year":"2018","unstructured":"Kr\u00f6mer, P., Nowakov\u00e1, J., Hasal, M.: Towards a new evolutionary algorithm for the minimum tollbooth problem. In: Chen, X., Sen, A., Li, W.W., Thai, M.T. (eds.) CSoNet 2018. LNCS, vol. 11280, pp. 116\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04648-4_10"},{"key":"1_CR19","unstructured":"Nickerl, J.: The minimum tollbooth problem in atomic network congestion games with unsplittable flows. arXiv preprint arXiv:1906.09865 (2019)"},{"key":"1_CR20","unstructured":"Pigou, A.C.: The Economics of Welfare. McMillan&Co., London (1920)"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? JACM 49(2), 236\u2013259 (2002)","journal-title":"JACM"},{"issue":"1\u20132","key":"1_CR22","first-page":"119","volume":"249","author":"F Stefanello","year":"2015","unstructured":"Stefanello, F., et al.: On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res. 249(1\u20132), 119\u2013139 (2015)","journal-title":"Ann. Oper. Res."},{"key":"1_CR23","unstructured":"Todd, J.: Duke student math aims to alleviate tollbooth lines. Duke University News and Communications (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34980-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T19:47:56Z","timestamp":1695412076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34980-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349790","9783030349806"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34980-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","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":"22","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":"8","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":"18% - 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":"5","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)"}}]}}