{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:30Z","timestamp":1740122190325,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61173011"],"award-info":[{"award-number":["61173011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/K01000X\/1","EP\/K01000X\/1"],"award-info":[{"award-number":["EP\/K01000X\/1","EP\/K01000X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10458-016-9335-7","type":"journal-article","created":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T15:39:58Z","timestamp":1466005198000},"page":"584-605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pricing ad slots with consecutive multi-unit demand"],"prefix":"10.1007","volume":"31","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Tang","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":[[2016,6,15]]},"reference":[{"issue":"2","key":"9335_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/120878422","volume":"43","author":"S Alaei","year":"2014","unstructured":"Alaei, S. (2014). Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM Journal on Computing, 43(2), 930\u2013972.","journal-title":"SIAM Journal on Computing"},{"key":"9335_CR2","first-page":"1704","volume":"10","author":"I Ashlagi","year":"2010","unstructured":"Ashlagi, I., Braverman, M., Hassidim, A., Lavi, R., & Tennenholtz, M. (2010). Position auctions with budgets: Existence and uniqueness. The BE Journal of Theoretical Economics, 10, 1704\u20131935.","journal-title":"The BE Journal of Theoretical Economics"},{"key":"9335_CR3","doi-asserted-by":"publisher","unstructured":"Balseiro, S. R., Besbes, O., & Weintraub, G. Y. (2013). Auctions for online display advertising exchanges: Approximations and design. In Proceedings of the fourteenth ACM conference on electronic commerce, EC\u201913 (pp. 53\u201354). New York: ACM. doi:\n                        10.1145\/2482540.2482576\n                        \n                    .","DOI":"10.1145\/2482540.2482576"},{"key":"9335_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.4086\/toc.2012.v008a020","volume":"8","author":"S Bhattacharya","year":"2012","unstructured":"Bhattacharya, S., Goel, G., Gollapudi, S., & Munagala, K. (2012). Budget-constrained auctions with heterogeneous items. Theory of Computing, 8, 429\u2013460.","journal-title":"Theory of Computing"},{"key":"9335_CR5","doi-asserted-by":"publisher","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Jain, K., Etesami, O., & Mahdian, M. (2007). Dynamics of bid optimization in online advertisement auctions. In Proceedings of the 16th international conference on World Wide Web (pp. 531\u2013540). New York: ACM.","DOI":"10.1145\/1242572.1242644"},{"key":"9335_CR6","unstructured":"Boutilier, C., Parkes, D. C., Sandholm, T., & Walsh, W. E. (2008). Expressive banner ad auctions and model-based online optimization for clearing. In Proceedings of the 23rd national conference on artificial intelligence, AAAI\u201908 (vol. 1, pp. 30\u201337). AAAI. \n                        http:\/\/dl.acm.org\/citation.cfm?id=1619995.1620002\n                        \n                    ."},{"key":"9335_CR7","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. (2008). Uniform budgets and the envy-free pricing problem. Automata, languages and programming (pp. 808\u2013819). Berlin: Springer."},{"key":"9335_CR8","doi-asserted-by":"publisher","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S. M. (2012). An algorithmic characterization of multi-dimensional mechanisms. In Proceedings of the forty-fourth annual ACM symposium on theory of computing (pp. 459\u2013478). New York: ACM.","DOI":"10.1145\/2213977.2214021"},{"key":"9335_CR9","doi-asserted-by":"publisher","unstructured":"Cai, Y., Daskalakis, C., & Weinberg, S. M. (2012). Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization. In Proceedings of the fifty-third annual IEEE symposium on foundations of computer science (pp. 130\u2013139). IEEE.","DOI":"10.1109\/FOCS.2012.88"},{"key":"9335_CR10","unstructured":"Cantillon, E., & Pesendorfer, M. (2007). Combination bidding in multi-unit auctions. CEPR discussion papers, 6083."},{"key":"9335_CR11","unstructured":"Caragiannis, I., Chatzigeorgiou, X., Kanellopoulos, P., Krimpas, G. A., Protopapas, N., & Voudouris, A. A. (2015). Efficiency and complexity of price competition among single-product vendors. In IJCAI (pp. 25\u201331). AAAI."},{"key":"9335_CR12","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. (2010). Envy-free pricing in multi-item markets. Automata, languages and programming (pp. 418\u2013429). Berlin: Springer. doi:\n                        10.1007\/978-3-642-14162-1_35\n                        \n                    ."},{"key":"9335_CR13","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1007\/s10878-014-9817-y","volume":"31","author":"N Chen","year":"2014","unstructured":"Chen, N., Deng, X., Goldberg, P., & Zhang, J. (2014). On revenue maximization with sharp multi-unit demands. Journal of Combinatorial Optimization, 31, 1174\u20131205. doi:\n                        10.1007\/s10878-014-9817-y\n                        \n                    .","journal-title":"Journal of Combinatorial Optimization"},{"key":"9335_CR14","doi-asserted-by":"publisher","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. The Journal of Political Economy, 94, 863\u2013872.","journal-title":"The Journal of Political Economy"},{"issue":"1","key":"9335_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1257\/000282807780323523","volume":"97","author":"B Edelman","year":"2007","unstructured":"Edelman, B., Ostrovsky, M., & Schwarz, M. (2007). Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. The American Economic Review, 97(1), 242\u2013259.","journal-title":"The American Economic Review"},{"issue":"2","key":"9335_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s001990050220","volume":"12","author":"R Engelbrecht-Wiggans","year":"1998","unstructured":"Engelbrecht-Wiggans, R., & Kahn, C. M. (1998). Multi-unit auctions with uniform prices. Economic Theory, 12(2), 227\u2013258.","journal-title":"Economic Theory"},{"key":"9335_CR17","doi-asserted-by":"publisher","unstructured":"Feldman, J., Muthukrishnan, S., Pal, M., & Stein, C. (2007). Budget optimization in search-based advertising auctions. In Proceedings of the 8th ACM conference on electronic commerce (pp. 40\u201349). New York: ACM (2007).","DOI":"10.1145\/1250910.1250917"},{"key":"9335_CR18","doi-asserted-by":"publisher","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). New York: ACM (2012).","DOI":"10.1145\/2229012.2229052"},{"key":"9335_CR19","doi-asserted-by":"publisher","unstructured":"Feldman, M., Gravin, N., & Lucier, B. (2015). Combinatorial auctions via posted prices. In SODA\u201915. SIAM.","DOI":"10.1137\/1.9781611973730.10"},{"issue":"4","key":"9335_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M. R., & Johnson, D. S. (1975). Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4(4), 397\u2013411.","journal-title":"SIAM Journal on Computing"},{"key":"9335_CR21","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-10841-9_20","volume-title":"Internet and network economics","author":"A Ghosh","year":"2009","unstructured":"Ghosh, A., McAfee, P., Papineni, K., & Vassilvitskii, S. (2009). Bidding for representative allocations for display advertising. Internet and network economics (pp. 208\u2013219). Berlin: Springer."},{"key":"9335_CR22","unstructured":"Graepel, T., Candela, J. Q., Borchert, T., & Herbrich, R. (2010). Web-scale bayesian click-through rate prediction for sponsored search advertising in microsoft\u2019s bing search engine. In Proceedings of the 27th international conference on machine learning (ICML-10) (pp. 13\u201320)."},{"issue":"1","key":"9335_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/jeth.1999.2531","volume":"87","author":"F Gul","year":"1999","unstructured":"Gul, F., & Stacchetti, E. (1999). Walrasian equilibrium with gross substitutes. Journal of Economic Theory, 87(1), 95\u2013124.","journal-title":"Journal of Economic Theory"},{"key":"9335_CR24","unstructured":"Guruswami, V., Hartline, J. D., Karlin, A. R., Kempe, D., Kenyon, C., & McSherry, F. (2005) 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."},{"key":"9335_CR25","unstructured":"He, D., Chen, W., Wang, L., & Liu, T. Y. (2013). A game-theoretic machine learning approach for revenue maximization in sponsored search. In Proceedings of the twenty-third international joint conference on artificial intelligence (IJCAI) (pp. 206\u2013212). AAAI."},{"key":"9335_CR26","doi-asserted-by":"publisher","unstructured":"Korula, N., Mirrokni, V., & Nazerzadeh, H. (2016). Optimizing display advertising markets: Challenges and directions. IEEE Internet Computing.","DOI":"10.1109\/MIC.2015.137"},{"key":"9335_CR27","unstructured":"Kuminov, D., & Tennenholtz, M. (2009). User modeling in position auctions: Re-considering the GSP and VCG mechanisms. In Autonomous agents and multiagent systems, AAMAS\u201909 (pp. 273\u2013280). Richland, SC. \n                        http:\/\/dl.acm.org\/citation.cfm?id=1558013.1558050\n                        \n                    ."},{"key":"9335_CR28","doi-asserted-by":"publisher","unstructured":"Lahaie, S. (2006). An analysis of alternative slot auction designs for sponsored search. In Proceedings of the 7th ACM conference on electronic commerce (pp. 218\u2013227). New York: ACM.","DOI":"10.1145\/1134707.1134731"},{"key":"9335_CR29","unstructured":"Lahaie, S., Parkes, D. C., & Pennock, D. M. (2008). An expressive auction design for online display advertising. In AAAI (pp. 108\u2013113)."},{"issue":"5","key":"9335_CR30","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D Lehmann","year":"2002","unstructured":"Lehmann, D., O\u0107allaghan, L. I., & Shoham, Y. (2002). Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM, 49(5), 577\u2013602. doi:\n                        10.1145\/585265.585266\n                        \n                    .","journal-title":"Journal of the ACM"},{"key":"9335_CR31","doi-asserted-by":"publisher","unstructured":"Lucier, B., Paes Leme, R., & Tardos, E. (2012). On revenue in the generalized second price auction. In Proceedings of the 21st international conference on world wide web, WWW\u201912 (pp. 361\u2013370). New York: ACM. doi:\n                        10.1145\/2187836.2187886\n                        \n                    .","DOI":"10.1145\/2187836.2187886"},{"issue":"3","key":"9335_CR32","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10660-012-9094-8","volume":"12","author":"P Maill\u00e9","year":"2012","unstructured":"Maill\u00e9, P., Markakis, E., Naldi, M., Stamoulis, G. D., & Tuffin, B. (2012). Sponsored search auctions: An overview of research with emphasis on game theoretic aspects. Electronic Commerce Research, 12(3), 265\u2013300.","journal-title":"Electronic Commerce Research"},{"key":"9335_CR33","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.artint.2014.07.002","volume":"216","author":"R Meir","year":"2014","unstructured":"Meir, R., Lu, T., Tennenholtz, M., & Boutilier, C. (2014). On the value of using group discounts under price competition. Artificial Intelligence, 216, 163\u2013178.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9335_CR34","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research, 6(1), 58\u201373.","journal-title":"Mathematics of Operations Research"},{"key":"9335_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. V. (2007). Algorithmic game theory (Vol. 1). Cambridge: Cambridge University Press."},{"key":"9335_CR36","unstructured":"Parkes, D. C., & Sandholm, T. (2005). Optimize-and-dispatch architecture for expressive ad auctions. In 1st workshop on ad auctions."},{"issue":"4","key":"9335_CR37","doi-asserted-by":"publisher","first-page":"60:1","DOI":"10.1145\/2668108","volume":"5","author":"T Qin","year":"2015","unstructured":"Qin, T., Chen, W., & Liu, T. Y. (2015). Sponsored search auctions: Recent advances and future directions. ACM Transactions on Intelligent Systems and Technology, 5(4), 60:1\u201360:34. doi:\n                        10.1145\/2668108\n                        \n                    .","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"8","key":"9335_CR38","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"MH Rothkopf","year":"1998","unstructured":"Rothkopf, M. H., Peke\u010d, A., & Harstad, R. M. (1998). Computationally manageable combinational auctions. Management Science, 44(8), 1131\u20131147.","journal-title":"Management Science"},{"issue":"1","key":"9335_CR39","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L. S., & Shubik, M. (1971). The assignment game I: The core. International Journal of Game Theory, 1(1), 111\u2013130.","journal-title":"International Journal of Game Theory"},{"key":"9335_CR40","unstructured":"Tang, B., & Zhang, J. (2015). Envy-free sponsored search auctions with budgets. In Proceedings of the twenty-fourth international joint conference on artificial intelligence (IJCAI\u201915). AAAI."},{"issue":"6","key":"9335_CR41","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.ijindorg.2006.10.002","volume":"25","author":"HR Varian","year":"2007","unstructured":"Varian, H. R. (2007). Position auctions. International Journal of Industrial Organization, 25(6), 1163\u20131178.","journal-title":"International Journal of Industrial Organization"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9335-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-016-9335-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9335-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9335-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T02:09:32Z","timestamp":1492654172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-016-9335-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9335"],"URL":"https:\/\/doi.org\/10.1007\/s10458-016-9335-7","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2016,6,15]]}}}