{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:26:04Z","timestamp":1765545964174},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T00:00:00Z","timestamp":1418083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9817-y","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T14:22:36Z","timestamp":1418048556000},"page":"1174-1205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On revenue maximization with sharp multi-unit demands"],"prefix":"10.1007","volume":"31","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinshan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,9]]},"reference":[{"key":"9817_CR1","volume-title":"Demand revelation and inefficiency in multi-unit auctions","author":"Lawrence M Ausubel","year":"1996","unstructured":"Ausubel Lawrence M, Cramton Peter (1996) Demand revelation and inefficiency in multi-unit auctions, vol 98. University of Maryland, Mimeo"},{"key":"9817_CR2","doi-asserted-by":"crossref","unstructured":"Balcan MF, Blum A (2006) Approximation algorithms and online mechanisms for item pricing. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 29\u201335","DOI":"10.1145\/1134707.1134711"},{"key":"9817_CR3","doi-asserted-by":"crossref","unstructured":"Balcan MF, Blum A, Mansour Y (2008) Item pricing for revenue maximization. In: Proceedings of the 9th ACM conference on Electronic commerce, pp. 50\u201359","DOI":"10.1145\/1386790.1386802"},{"key":"9817_CR4","first-page":"23","volume":"38","author":"Alexa Bezjian-Avery","year":"1998","unstructured":"Bezjian-Avery Alexa, Calder Bobby, Iacobucci Dawn (1998) New media interactive advertising vs. traditional advertising. J Advert Res 38:23\u201332","journal-title":"J Advert Res"},{"key":"9817_CR5","unstructured":"Bil\u00f2 V, Flammini M, Monaco G (2013) Approximating the revenue maximization problem with sharp demands. arXiv preprint arXiv:1312.3892"},{"key":"9817_CR6","doi-asserted-by":"crossref","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 (2008) Uniform budgets and the envy-free pricing problem. Automata, languages and programming. Springer, Berlin, pp 808\u2013819"},{"key":"9817_CR7","doi-asserted-by":"crossref","unstructured":"Briest P, Krysta P (2006) Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm, pp. 1093\u20131102","DOI":"10.1145\/1109557.1109678"},{"key":"9817_CR8","volume-title":"Combination bidding in multi-unit auctions","author":"E Cantillon","year":"2013","unstructured":"Cantillon E, Pesendorfer M (2013) Combination bidding in multi-unit auctions. The London School of Economics and Political Science, London"},{"issue":"2","key":"9817_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/2567923","volume":"10","author":"N Chen","year":"2014","unstructured":"Chen N, Deng X (2014) Envy-free pricing in multi-item markets. ACM Trans Algorithms 10(2):7","journal-title":"ACM Trans Algorithms"},{"issue":"3","key":"9817_CR10","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1137\/080740970","volume":"40","author":"N Chen","year":"2011","unstructured":"Chen N, Ghosh A, Vassilvitskii S (2011) Optimal envy-free pricing with metric substitutability. SIAM J Comput 40(3):623\u2013645","journal-title":"SIAM J Comput"},{"key":"9817_CR11","doi-asserted-by":"crossref","unstructured":"Cheung M, Swamy C (2008) Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, 2008. FOCS\u201908, pp. 35\u201344","DOI":"10.1109\/FOCS.2008.15"},{"issue":"4","key":"9817_CR12","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"G Demange","year":"1986","unstructured":"Demange G, Gale D, Sotomayor M (1986) Multi-item auctions. J Polit Econ 94(4):863\u2013872","journal-title":"J Polit Econ"},{"key":"9817_CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-3-642-41392-6_22","volume-title":"Algorithmic game theory","author":"X Deng","year":"2013","unstructured":"Deng X, Goldberg P, Sun Y, Tang B, Zhang J (2013) Pricing ad slots with consecutive multi-unit demand. Algorithmic game theory. Springer, Berlin, pp 255\u2013266"},{"key":"9817_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-14553-7_4","volume-title":"Frontiers in algorithmics","author":"X Deng","year":"2010","unstructured":"Deng X, Sun Y, Yin M, Zhou Y (2010) Mechanism design for multi-slot ads auction in sponsored search markets. Frontiers in algorithmics. Springer, Berlin, pp 11\u201322"},{"key":"9817_CR15","doi-asserted-by":"crossref","unstructured":"Edelman B, Ostrovsky M, Schwarz M (2005) Internet advertising and the generalized second price auction: selling billions of dollars worth of keywords. Technical report, National Bureau of Economic Research","DOI":"10.3386\/w11765"},{"key":"9817_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-642-04645-2_25","volume-title":"Algorithmic game theory","author":"K Elbassioni","year":"2009","unstructured":"Elbassioni K, Raman R, Ray S, Sitters R (2009) On profit-maximizing pricing for the highway and tollbooth problems. Algorithmic game theory. Springer, Berlin, pp 275\u2013286"},{"issue":"2","key":"9817_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s001990050220","volume":"12","author":"Richard Engelbrecht-Wiggans","year":"1998","unstructured":"Engelbrecht-Wiggans Richard, Kahn Charles M (1998) Multi-unit auctions with uniform prices. Econ Theory 12(2):227\u2013258","journal-title":"Econ Theory"},{"key":"9817_CR18","doi-asserted-by":"crossref","unstructured":"Feldman M, Fiat A, Leonardi S, Sankowski P (2012) Revenue maximizing envy-free multi-unit auctions with budgets. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 532\u2013549","DOI":"10.1145\/2229012.2229052"},{"key":"9817_CR19","doi-asserted-by":"crossref","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 (2009) Envy, multi envy, and revenue maximization. Internet and network economics. Springer, Berlin, pp 498\u2013504"},{"key":"9817_CR20","volume-title":"Internet and network economics","author":"A Ghosh","year":"2007","unstructured":"Ghosh A, Nazerzadeh H, Sundararajan M (2007) Computing optimal bundles for sponsored search. Internet and network economics. Springer, Berlin"},{"key":"9817_CR21","doi-asserted-by":"crossref","unstructured":"Grandoni F, Rothvo\u00df T (2011) Pricing on paths: a ptas for the highway problem. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 675\u2013684","DOI":"10.1137\/1.9781611973082.53"},{"issue":"1","key":"9817_CR22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/jeth.1999.2531","volume":"87","author":"Faruk Gul","year":"1999","unstructured":"Gul Faruk, Stacchetti Ennio (1999) Walrasian equilibrium with gross substitutes. J Econ Theory 87(1):95\u2013124","journal-title":"J Econ Theory"},{"key":"9817_CR23","unstructured":"Guruswami V, Hartline JD, Karlin AR, Kempe D, Kenyon C, McSherry F (2005) On profit-maximizing envy-free pricing. In: Proceedings of the 16th annual ACM-SIAM symposium on Discrete algorithms, pp. 1164\u20131173. Society for Industrial and Applied Mathematics"},{"key":"9817_CR24","doi-asserted-by":"crossref","unstructured":"Hartline J, Yan Q (2011) Envy, truth, and profit. In: Proceedings of the 12th ACM conference on electronic commerce, pp. 243\u2013252","DOI":"10.1145\/1993574.1993612"},{"key":"9817_CR25","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11534273_37","volume-title":"Algorithms and data structures","author":"JD Hartline","year":"2005","unstructured":"Hartline JD, Vladlen K (2005) Near-optimal pricing in near-linear time. Algorithms and data structures. Springer, Berlin, pp 422\u2013431"},{"issue":"3","key":"9817_CR26","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s00355-009-0376-6","volume":"33","author":"JW Hatfield","year":"2009","unstructured":"Hatfield JW (2009) Strategy-proof, efficient, and nonbossy quota allocations. Soc Choice Welf 33(3):505\u2013515","journal-title":"Soc Choice Welf"},{"key":"9817_CR27","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-642-15781-3_4","volume-title":"Algorithms-ESA 2010","author":"P Krysta","year":"2010","unstructured":"Krysta P, Ventre C (2010) Combinatorial auctions with verification are tractable. Algorithms-ESA 2010. Springer, Berlin, pp 39\u201350"},{"key":"9817_CR28","volume-title":"Microeconomic theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell A, Whinston MD, Green JR et al (1995) Microeconomic theory, vol 1. Oxford University Press, New York"},{"key":"9817_CR29","volume-title":"Automata, languages and programming","author":"N Nisan","year":"2009","unstructured":"Nisan N, Bayer J, Chandra D, Franji T, Gardner R, Matias Y, Rhodes N, Seltzer M, Tom D, Varian H et al (2009) Googles auction for tv ads. Automata, languages and programming. Springer, Berlin"},{"issue":"2","key":"9817_CR30","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1080\/15252019.2009.10722152","volume":"9","author":"Ginger Rosenkrans","year":"2009","unstructured":"Rosenkrans Ginger (2009) The creativeness and effectiveness of online interactive rich media advertising. J Interact Advert 9(2):18\u201331","journal-title":"J Interact Advert"},{"issue":"1","key":"9817_CR31","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"Lloyd S Shapley","year":"1971","unstructured":"Shapley Lloyd S, Shubik Martin (1971) The assignment game i: the core. Int J Game Theory 1(1):111\u2013130","journal-title":"Int J Game Theory"},{"issue":"6","key":"9817_CR32","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1016\/j.ijindorg.2006.10.002","volume":"25","author":"HR Varian","year":"2007","unstructured":"Varian HR (2007) Position auctions. Int J Ind Organ 25(6):1163\u20131178","journal-title":"Int J Ind Organ"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9817-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9817-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9817-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9817-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,9]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9817"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9817-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,9]]}}}