{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:11Z","timestamp":1750307711220,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>In this note we report recent results on item pricing for revenue maximization in the presence of buyers with complex, unknown preferences. We focus on two important classes of settings: buyers with general valuations for the case of items in unlimited supply, and buyers with subadditive valuations for the case of items in limited supply.<\/jats:p>","DOI":"10.1145\/1486877.1486883","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T14:41:13Z","timestamp":1232462473000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Item pricing for revenue maximization"],"prefix":"10.1145","volume":"7","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[{"name":"Microsoft Research, New England"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[{"name":"Google Inc. and Tel Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386802"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science.","author":"BRIEST P.","year":"2008","unstructured":"BRIEST , P. , HOEFER , M. , AND KRYSTA ., P. 2008 . Stackelberg network pricing games . In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science. BRIEST, P., HOEFER, M., AND KRYSTA., P. 2008. Stackelberg network pricing games. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"CRAMTON P. SHOAM Y. AND STEINBERG R. 2005. Combinatorial Auctions. Springer-Verlag.   CRAMTON P. SHOAM Y. AND STEINBERG R. 2005. Combinatorial Auctions . Springer-Verlag.","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250960"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132607"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132523"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 1164-1173","author":"GURUSWAMI V.","year":"2005","unstructured":"GURUSWAMI , V. , HARTLINE , J. , KARLIN , A. , KEMPE , D. , KENYON , C. , AND MCSHERRY , F. 2005 . On Profit-Maximizing Envy-Free Pricing . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 1164-1173 . GURUSWAMI, V., HARTLINE, J., KARLIN, A., KEMPE, D., KENYON, C., AND MCSHERRY, F. 2005. On Profit-Maximizing Envy-Free Pricing. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 1164-1173."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"LEHMANN B. LEHMANN D. AND NISAN N. 2006. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior.  LEHMANN B. LEHMANN D. AND NISAN N. 2006. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior .","DOI":"10.1016\/j.geb.2005.02.006"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"NISAN N. 2007. Introduction to mechanism design (for computer scientists). In Algorithmic Game Theory N. Nisan T. Roughgarden E. Tardos and V. Vazirani Eds. Cambridge University Press.  NISAN N. 2007. Introduction to mechanism design (for computer scientists). In Algorithmic Game Theory N. Nisan T. Roughgarden E. Tardos and V. Vazirani Eds. Cambridge University Press.","DOI":"10.1017\/CBO9780511800481"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1486877.1486883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1486877.1486883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:11Z","timestamp":1750253411000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1486877.1486883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1486877.1486883"],"URL":"https:\/\/doi.org\/10.1145\/1486877.1486883","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2008-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}