{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:44:42Z","timestamp":1725763482887},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_45","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"479-490","source":"Crossref","is-referenced-by-count":0,"title":["New Results on the Online Pricing Problem"],"prefix":"10.1007","author":[{"given":"Xiangzhong","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Babaioff, M., Dughmi, S., Roughgarden, T.: Combinatorial auctions with restricted complements. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 3\u201316. ACM (2012)","DOI":"10.1145\/2229012.2229016"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 29\u201335. ACM (2006)","DOI":"10.1145\/1134707.1134711"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 50\u201359. ACM (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 72\u201387. ACM (2003)","DOI":"10.1145\/846241.846250"},{"key":"45_CR5","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":"45_CR6","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1093\u20131102. ACM (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-32512-0_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Chalermsook","year":"2012","unstructured":"Chalermsook, P., Chuzhoy, J., Kannan, S., Khanna, S.: Improved hardness results for profit maximization pricing problems with unlimited supply. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX 2012 and RANDOM 2012. LNCS, vol.\u00a07408, pp. 73\u201384. Springer, Heidelberg (2012)"},{"key":"45_CR8","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":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-79309-0_16","volume-title":"Algorithmic Game Theory","author":"R. Cole","year":"2008","unstructured":"Cole, R., Dobzinski, S., Fleischer, L.K.: Prompt mechanisms for online auctions. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 170\u2013181. Springer, Heidelberg (2008)"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jcss.2011.02.010","volume":"78","author":"S. Dobzinski","year":"2012","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. Journal of Computer and System Sciences\u00a078(1), 15\u201325 (2012)","journal-title":"Journal of Computer and System Sciences"},{"key":"45_CR11","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":"45_CR12","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1164\u20131173. Society for Industrial and Applied Mathematics (2005)"},{"key":"45_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)"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 233\u2013241. ACM (2000)","DOI":"10.1145\/352871.352897"},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior\u00a055(2), 270\u2013296 (2006)","journal-title":"Games and Economic Behavior"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Probabilistic computations: Toward a unified measure of complexity. In: FOCS (1977)","DOI":"10.1109\/SFCS.1977.24"},{"key":"45_CR17","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)"},{"key":"45_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-29700-7_8","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y. Zhang","year":"2012","unstructured":"Zhang, Y., Chin, F.Y.L., Ting, H.-F.: Online pricing for multi-type of items. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol.\u00a07285, pp. 82\u201392. Springer, Heidelberg (2012)"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, Y., Chin, F.Y.L., Ting, H.-F.: Competitive algorithms for online pricing. Discrete Mathematics, Algorithms and Applications\u00a04(02) (2012)","DOI":"10.1142\/S1793830912500152"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:38:03Z","timestamp":1558780683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}