{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:05:45Z","timestamp":1755925545010},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_49","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T09:53:05Z","timestamp":1271843585000},"page":"565-576","source":"Crossref","is-referenced-by-count":10,"title":["Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization"],"prefix":"10.1007","author":[{"given":"Vahab","family":"Mirrokni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Nadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. In: COLT 2008 (2008)","key":"49_CR1"},{"doi-asserted-by":"crossref","unstructured":"Baliga, S., Vohra, R.: Market Research and Market Design (2003)","key":"49_CR2","DOI":"10.2202\/1534-5963.1059"},{"doi-asserted-by":"crossref","unstructured":"Baye, M., Kovenock, D., de Vried, C.: The all-pay auction with Complete Information. Economic Theory\u00a08, 291\u2013305","key":"49_CR3","DOI":"10.1007\/s001990050092"},{"doi-asserted-by":"crossref","unstructured":"Che, Y., Gale, I.: Expected revenue of all-pay auctions and first-price sealed-bid auctions with budget constraints. Economic Letters, 373\u2013379 (1996)","key":"49_CR4","DOI":"10.1016\/0165-1765(95)00766-0"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E. Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"doi-asserted-by":"crossref","unstructured":"Even Dar, E., Mansour, Y., Nadav, U.: On the convergence of regret minimization dynamics in concave games. In: STOC 2009 (2009)","key":"49_CR6","DOI":"10.1145\/1536414.1536486"},{"doi-asserted-by":"crossref","unstructured":"Fiat, A., Goldberg, A.V., Hartline, J.D., Karlin, A.R.: Competitive generalized auctions. In: STOC 2002, pp. 72\u201381 (2002)","key":"49_CR7","DOI":"10.1145\/509919.509921"},{"issue":"4","key":"49_CR8","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\u00a041(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"unstructured":"Hajek, B., Gopalakrishnan, G.: Do greedy autonomous systems make for a sensible internet? Presented at the Conference on Stochastic Networks, Stanford University (2002)","key":"49_CR9"},{"doi-asserted-by":"crossref","unstructured":"Hartline, J., Karline, A.: Profit Maximization in Mechanism Design. In: Algorithmic Game Theory (October 2007)","key":"49_CR10","DOI":"10.1017\/CBO9780511800481.015"},{"issue":"3","key":"49_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R. Johari","year":"2004","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Mathematics of Operations Research\u00a029(3), 407\u2013435 (2004)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"49_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. Syst. Sci.\u00a071(3), 291\u2013307 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F. Kelly","year":"1997","unstructured":"Kelly, F.: Charging and rate control for elastic traffic. European Transactions on Telecommunications\u00a08, 33\u201337 (1997)","journal-title":"European Transactions on Telecommunications"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.dss.2005.10.012","volume":"42","author":"D. Liu","year":"2006","unstructured":"Liu, D., Chen, J.: Designing online auctions with past performance information. Decision Support Systems\u00a042, 1307\u20131320 (2006)","journal-title":"Decision Support Systems"},{"key":"49_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11944874_4","volume-title":"Internet and Network Economics","author":"P. Lu","year":"2006","unstructured":"Lu, P., Teng, S.-H., Yu, C.: Truthful Auctions with Optimal Profit. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 27\u201336. Springer, Heidelberg (2006)"},{"key":"49_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Rosen, J.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 520\u2013534 (1965)","key":"49_CR17","DOI":"10.2307\/1911749"},{"issue":"3","key":"49_CR18","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. American Economic Review\u00a093(3), 509\u2013529 (2003)","journal-title":"American Economic Review"},{"issue":"1","key":"49_CR19","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive-sealed tenders. Finance\u00a016(1), 8\u201337 (1961)","journal-title":"Finance"},{"unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Twentieth International Conference on Machine Learning (2003)","key":"49_CR20"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T17:32:52Z","timestamp":1685554372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}