{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:53:37Z","timestamp":1680468817762},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p> We propose algorithms for pricing a transportation network in such a way that the profit generated by the customers is maximized. We model the transportation network as a subset of the plane and take into account the fact that the customers minimize their own transportation cost. The underlying theory is a two-player game model called Stackelberg games. We propose algorithms for the cases where the fare does and does not depend on the distance traveled, in the L<jats:sub>1<\/jats:sub> or L<jats:sub>2<\/jats:sub> metrics. In particular, we propose an O(n log n) algorithm for optimal pricing of a highway under the L<jats:sub>2<\/jats:sub> metric, and an O(nk log n log <jats:sup>3<\/jats:sup> k) algorithm for orthogonally convex networks of complexity O(k) under the L<jats:sub>1<\/jats:sub> metric. <\/jats:p>","DOI":"10.1142\/s021819590900309x","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T05:22:17Z","timestamp":1262841737000},"page":"507-520","source":"Crossref","is-referenced-by-count":3,"title":["PRICING GEOMETRIC TRANSPORTATION NETWORKS"],"prefix":"10.1142","volume":"19","author":[{"given":"JEAN","family":"CARDINAL","sequence":"first","affiliation":[{"name":"Computer Science Department, Universit\u00e9 Libre de Bruxelles CP212, Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARTINE","family":"LABB\u00c9","sequence":"additional","affiliation":[{"name":"Computer Science Department, Universit\u00e9 Libre de Bruxelles CP212, Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEFAN","family":"LANGERMAN","sequence":"additional","affiliation":[{"name":"Computer Science Department, Universit\u00e9 Libre de Bruxelles CP212, Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BEL\u00c9N","family":"PALOP","sequence":"additional","affiliation":[{"name":"Computer Science Department, Universidad de Valladolid Valladolid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00505-7"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2947-0"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1023\/B:NETS.0000015653.52983.61"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.3.289.12299"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.35.4.345.10433"},{"key":"rf10","author":"Cardinal J.","journal-title":"Comput. Geom. Th. Appl."},{"key":"rf12","doi-asserted-by":"crossref","unstructured":"S.\u00a0Fortune, Handbook of Computational Geometry: Voronoi Diagrams and Delaunay Triangulations (CRC Press, 2004)\u00a0pp. 513\u2013528.","DOI":"10.1201\/9781420035315.ch23"},{"key":"rf14","first-page":"73","volume":"1","author":"Graham R.","journal-title":"Inform. Process. Lett."},{"key":"rf17","first-page":"264","author":"Mata C. S.","journal-title":"ACM Ann. Symp. Computational Geometry"},{"key":"rf18","doi-asserted-by":"crossref","unstructured":"J. S. B.\u00a0Mitchell, Handbook of Discrete and Computational Geometry: Shortest paths and networks (CRC Press, 2004)\u00a0pp. 607\u2013642.","DOI":"10.1201\/9781420035315.ch27"},{"key":"rf19","first-page":"56","volume":"46","author":"Roch S.","journal-title":"Networks"},{"key":"rf20","volume-title":"Games, Theory and Applications","author":"Thomas L. C.","year":"2003"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819590900309X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:24:04Z","timestamp":1565123044000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819590900309X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":12,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1142\/S021819590900309X"],"URL":"https:\/\/doi.org\/10.1142\/s021819590900309x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}