{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:53Z","timestamp":1743049673324,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_1","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Sequential Posted Price Mechanisms with Correlated Valuations"],"prefix":"10.1007","author":[{"given":"Marek","family":"Adamczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allan","family":"Borodin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diodato","family":"Ferraioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"1_CR1","unstructured":"Adamczyk, M., Sviridenko, M., Ward, J.: Submodular stochastic probing on matroids. In: STACS 2014 (2014)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Adamczyk, M., Borodin, A., Ferraioli, D., de Keijzer, B., Leonardi, S.: Sequential posted price mechanisms with correlated valuations. CoRR, abs\/1503.02200 (2015)","DOI":"10.1007\/978-3-662-48995-6_1"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dughmi, S., Kleinberg, R., Slivkins, A.: Dynamic pricing with limited supply. In: EC 2012 (2012)","DOI":"10.1145\/2229012.2229023"},{"key":"1_CR4","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007 (2007)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: FOCS 2014 (2014)","DOI":"10.1109\/FOCS.2014.11"},{"key":"1_CR6","unstructured":"Blum, A., Hartline, J.D.: Near-optimal online auctions. In: SODA 2005 (2005)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2004.05.012","volume":"324","author":"A Blum","year":"2004","unstructured":"Blum, A., Kumar, V., Rudra, A., Wu, F.: Online learning in online auctions. Theor. Comput. Sci. 324, 137\u2013146 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Holenstein, T.: Posted prices vs. negotiations: an asymptotic analysis. In: EC 2008 (2008)","DOI":"10.1145\/1386790.1386801"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"B\u00f6rgers, T.: An Introduction to the Theory of Mechanism Design. Oxford University Press, Oxford (2015)","DOI":"10.1093\/acprof:oso\/9780199734023.001.0001"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Chawla, S., Fu, H., Karlin, A.: Approximate revenue maximization in interdependent value settings. In: EC 2014, pp. 277\u2013294 (2014)","DOI":"10.1145\/2600057.2602858"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: STOC 2010 (2010)","DOI":"10.1145\/1807406.1807428"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"issue":"6","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.2307\/1913096","volume":"56","author":"J Cremer","year":"1988","unstructured":"Cremer, J., McLean, R.P.: Full extraction of the surplus in bayesian and dominant strategy auctions. Econometrica 56(6), 1247\u20131257 (1988)","journal-title":"Econometrica"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Morgenstern, J., Syrgkanis, V., Weinberg, S.M.: Simple auctions with simple strategies. In: EC 2015, pp. 305\u2013322 (2015)","DOI":"10.1145\/2764468.2764484"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.D.: Optimal auctions with correlated bidders are easy. In: STOC 2011 (2011)","DOI":"10.1145\/1993636.1993655"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: SODA 2015 (2015)","DOI":"10.1137\/1.9781611973730.10"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica 41, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-36694-9_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Gupta","year":"2013","unstructured":"Gupta, A., Nagarajan, V.: A stochastic probing problem with applications. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 205\u2013216. Springer, Heidelberg (2013)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Hart, S., Nisan, N.: Approximate revenue maximization with multiple items. In: EC 2012 (2012)","DOI":"10.1145\/2229012.2229061"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1598780.1598785","volume":"8","author":"JD Hartline","year":"2009","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. SIGecom Exch. 8(1), 5:1\u20135:3 (2009)","journal-title":"SIGecom Exch."},{"key":"1_CR21","unstructured":"Kleinberg, R., Leighton, T.: The value of knowing a demand curve: bounds on regret for online posted-price auctions. In: FOCS 2003 (2003)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: STOC 2012 (2012)","DOI":"10.1145\/2213977.2213991"},{"issue":"1","key":"1_CR23","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.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ronen, A.: On approximating optimal auctions. In: EC 2001 (2001)","DOI":"10.1145\/501158.501160"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Talgam-Cohen, I.: Optimal and near-optimal mechanism design with interdependent values. In: EC 2013 (2013)","DOI":"10.1145\/2482540.2482606"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Rubinstein, A., Weinberg, S.M.: Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. In: EC 2015, pp. 377\u2013394 (2015)","DOI":"10.1145\/2764468.2764510"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","first-page":"73","volume-title":"Agent-Mediated Electronic Commerce V","author":"TW Sandholm","year":"2004","unstructured":"Sandholm, T.W., Gilpin, A.: Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. In: Faratin, P., Parkes, D.C., Rodr\u00edguez-Aguilar, J.-A., Walsh, W.E. (eds.) AMEC 2003. LNCS (LNAI), vol. 3048, pp. 73\u201391. Springer, Heidelberg (2004)"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1257\/000282803322156963","volume":"93","author":"I Segal","year":"2003","unstructured":"Segal, I.: Optimal pricing mechanisms with unknown demand. Am. Econ. Rev. 93(3), 509\u2013529 (2003)","journal-title":"Am. Econ. Rev."},{"issue":"1","key":"1_CR29","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Financ. 16(1), 8\u201337 (1961)","journal-title":"J. Financ."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: SODA 2011 (2011)","DOI":"10.1137\/1.9781611973082.56"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:13:18Z","timestamp":1703754798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}