{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:14Z","timestamp":1725677594083},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_8","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"82-92","source":"Crossref","is-referenced-by-count":1,"title":["Online Pricing for Multi-type of Items"],"prefix":"10.1007","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Balcan, N., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proc. of the 9th ACM Conference on Electronic Commerce (EC 2008), pp. 50\u201359 (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chen, N., Cherniavsky, N., Rurda, A., Schieber, B., Sviridenko, M.: Dynamic pricing for impatient bidders. ACM Transactions on Algorithms 6(2) (March 2010)","DOI":"10.1145\/1721837.1721851"},{"key":"8_CR3","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":"8_CR4","unstructured":"Briest, P., Krysta, P.: Buying cheap is expensive: hardness of non-parametric multi-product pricing. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, January 07-09, pp. 716\u2013725 (2007)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-14162-1_35","volume-title":"Automata, Languages and Programming","author":"N. Chen","year":"2010","unstructured":"Chen, N., Deng, X.: Envy-Free Pricing in Multi-item Markets. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 418\u2013429. Springer, Heidelberg (2010)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chen, N., Ghosh, A., Vassilvitskii, S.: Optimal envy-free pricing with metric substitutability. In: Proc. of the 9th ACM Conference on Electronic Commerce (EC 2008), pp. 60\u201369 (2008)","DOI":"10.1145\/1386790.1386803"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Cheung, M., Swamy, C.: Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. In: Proc. of 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 35\u201344 (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Elbassioni, K., Raman, R., Ray, S., Sitters, R.: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. In: Proceedings of the 2nd International Symposium on Algorithmic Game Theory, Paphos, Cyprus, October 18-20, pp. 275\u2013286 (2009)","DOI":"10.1007\/978-3-642-04645-2_25"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-75520-3_41","volume-title":"Algorithms \u2013 ESA 2007","author":"K. Elbassioni","year":"2007","unstructured":"Elbassioni, K., Sitters, R., Zhang, Y.: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 451\u2013462. Springer, Heidelberg (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-642-10841-9_48","volume-title":"Internet and Network Economics","author":"A. Fiat","year":"2009","unstructured":"Fiat, A., Wingarten, A.: Envy, Multi Envy, and Revenue Maximization. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 498\u2013504. Springer, Heidelberg (2009)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11917496_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Grigoriev","year":"2006","unstructured":"Grigoriev, A., van Loon, J., Sitters, R.A., Uetz, M.: How to Sell a Graph: Guidelines for Graph Retailers. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 125\u2013136. Springer, Heidelberg (2006)"},{"key":"8_CR12","unstructured":"Guruswami, V., Hartline, J., Karlin, A., Kempe, D., Kenyon, C., McSherry, F.: On Profit-Maximizing Envy-Free Pricing. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 1164\u20131173 (2005)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-17572-5_41","volume-title":"Internet and Network Economics","author":"S. Im","year":"2010","unstructured":"Im, S., Lu, P., Wang, Y.: Envy-Free Pricing with General Supply Constraints. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 483\u2013491. Springer, Heidelberg (2010)"},{"issue":"7","key":"8_CR14","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/j.tcs.2009.10.002","volume":"412","author":"R. Krauthgamer","year":"2011","unstructured":"Krauthgamer, R., Mehta, A., Rudra, A.: Pricing commodities. Theoretical Computer Science\u00a0412(7), 602\u2013613 (2011)","journal-title":"Theoretical Computer Science"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-22685-4_35","volume-title":"Computing and Combinatorics","author":"Y. Zhang","year":"2011","unstructured":"Zhang, Y., Chin, F.Y.L., Ting, H.-F.: Competitive Algorithms for Online Pricing. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 391\u2013401. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:14:08Z","timestamp":1620126848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}