{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:34Z","timestamp":1725541834720},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_6","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T12:14:44Z","timestamp":1260274484000},"page":"42-54","source":"Crossref","is-referenced-by-count":6,"title":["On Stackelberg Pricing with Computationally Bounded Consumers"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Briest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for Multi-Product Pricing. In: Proc. of 31st ICALP (2004)","DOI":"10.1007\/978-3-540-27836-8_9"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M., Blum, A.: Approximation Algorithms and Online Mechanisms for Item Pricing. In: Proc. of 7th EC (2006)","DOI":"10.1145\/1134707.1134711"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, N., Blum, A., Hartline, J., Mansour, Y.: Mechanism Design via Machine Learning. In: Proc. of 46th FOCS (2005)","DOI":"10.1109\/SFCS.2005.50"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M., Blum, A., Mansour, Y.: Item Pricing for Revenue Maximization. In: Proc. of 9th EC (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"6_CR5","unstructured":"Berman, P., Karpinski, M.: Improved Approximation Lower Bounds on Small Occurrence Optimization. ECCC-Report TR03-008 (2003)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-92185-1_32","volume-title":"Internet and Network Economics","author":"D. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G., Widmayer, P.: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 251\u2013262. Springer, Heidelberg (2008)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/978-3-540-70575-8_66","volume-title":"Automata, Languages and Programming","author":"P. Briest","year":"2008","unstructured":"Briest, P.: Uniform Budgets and the Envy-Free Pricing Problem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 808\u2013819. Springer, Heidelberg (2008)"},{"key":"6_CR8","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg Network Pricing Games. In: Proc. of 25th STACS (2008)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-Minded Unlimited-Supply Pricing on Sparse Instances. In: Proc. of 17th SODA (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"6_CR10","unstructured":"Briest, P., Krysta, P.: Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In: Proc. of 18th SODA (2007)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-73951-7_7","volume-title":"Algorithms and Data Structures","author":"J. Cardinal","year":"2007","unstructured":"Cardinal, J., Demaine, E., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg Minimum Spanning Tree Game. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 64\u201376. Springer, Heidelberg (2007)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J., Kleinberg, R.: Algorithmic Pricing via Virtual Valuations. In: Proc. of 8th EC (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Chen, N., Ghosh, A., Vassilvitskii, S.: Optimal Envy-free Pricing with Metric Substitutability. In: Proc. of 9th EC (2008)","DOI":"10.1145\/1386790.1386803"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination Can Be Hard: Approximability of the Unique Coverage Problem. In: Proc. of 17th SODA (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Elbassioni, K., Raman, R., Ray, S.: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. Technical report arXiv:0901.1140v1 (2009)","DOI":"10.1007\/978-3-642-04645-2_25"},{"key":"6_CR16","unstructured":"Elbassioni, K., Sitters, R., Zhang, Y.: A Quasi-PTAS for Envy-Free Pricing on Line Graphs. In: Proc. of 15th ESA (2007)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. In: Proc. of 45th FOCS (2004)","DOI":"10.1109\/FOCS.2004.69"},{"issue":"2-3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2005.09.014","volume":"348","author":"L. Fleischer","year":"2005","unstructured":"Fleischer, L.: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theoretical Computer Science\u00a0348(2-3), 217\u2013225 (2005)","journal-title":"Theoretical Computer Science"},{"key":"6_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"key":"6_CR20","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On Profit-Maximizing Envy-Free Pricing. In: Proc. of 16th SODA (2005)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11534273_37","volume-title":"Algorithms and Data Structures","author":"J. Hartline","year":"2005","unstructured":"Hartline, J., Koltun, V.: Near-Optimal Pricing in Near-Linear Time. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 422\u2013431. Springer, Heidelberg (2005)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.: Edge Pricing of Multicommodity Networks for Heterogeneous Users. In: Proc. of 45th FOCS (2004)","DOI":"10.1109\/FOCS.2004.26"},{"issue":"12","key":"6_CR23","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M. Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A Bilevel Model of Taxation and its Application to Optimal Highway Pricing. Management Science\u00a044(12), 1608\u20131622 (1998)","journal-title":"Management Science"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S. Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An Approximation Algorithm for Stackelberg Network Pricing. Networks\u00a046(1), 57\u201367 (2005)","journal-title":"Networks"},{"key":"6_CR25","unstructured":"Swamy, C.: The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games. In: Proc. of 18th SODA (2007)"},{"key":"6_CR26","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"6_CR27","volume-title":"Marktform und Gleichgewicht (Market and Equilibrium)","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer, Vienna (1934)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:35:43Z","timestamp":1606167343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}