{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081683,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_29","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"320-331","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Price Sequence and Incentive Compatibility"],"prefix":"10.1007","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew Chi-Chih","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-44634-6_13","volume-title":"Algorithms and Data Structures","author":"A. Bagchi","year":"2001","unstructured":"Bagchi, A., Chaudhary, A., Garg, R., Goodrich, M.T., Kumar, V.: Seller-Focused Algorithms for Online Auctioning. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 135\u2013147. Springer, Heidelberg (2001)"},{"key":"29_CR2","unstructured":"Bar-Yossef, Z., Hildrum, K., Wu, F.: Incentive-Compatible Online Auctions for Digital Goods. In: SODA 2002, pp. 964\u2013970 (2002)"},{"key":"29_CR3","unstructured":"Blum, A., Kumar, V., Rudra, A., Wu, F.: Online Learning in Online Auctions. In: Soda 2003, pp. 202\u2013204 (2003)"},{"key":"29_CR4","unstructured":"Blum, A., Sandholm, T., Zinkevich, M.: Online Algorithms for Market Clearing. In: SODA 2002, pp. 971\u2013980 (2002)"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X. Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.H.: On the Complexity of Cooperative Solution Concepts. Mathematics of Operations Research\u00a019(2), 257\u2013266 (1994)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X. Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic Aspects of the Core of Combinatorial Optimization Games. Mathematics of Operations Research\u00a024(3), 751\u2013766 (1999)","journal-title":"Mathematics of Operations Research"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-44968-X_31","volume-title":"Computing and Combinatorics","author":"X. Deng","year":"2000","unstructured":"Deng, X., Li, Z., Wang, S.: On Computation of Arbitrage for Markets with Friction. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 310\u2013319. Springer, Heidelberg (2000)"},{"key":"29_CR9","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)","DOI":"10.1145\/509907.509921"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Hartline, J., Wright, A.: Competitive Auctions and Digital Goods. In: SODA 2001, pp. 735\u2013744 (2001)","DOI":"10.1007\/3-540-44676-1_35"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentive in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"issue":"1-3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(03)00391-8","volume":"310","author":"R. Lavi","year":"2004","unstructured":"Lavi, R., Nisan, N.: Competitive Analysis of Incentive Compatible On-Line Auctions. Theoretical Computer Science\u00a0310(1-3), 159\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"29_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann, D., O\u2019Callaghan, L.I., Shoham, Y.: Truth Revelation in Approximately Efficient Combinatorial Auctions. JACM\u00a049(5), 577\u2013602 (2002)","journal-title":"JACM"},{"key":"29_CR14","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. In: AAAI 2002, pp. 379\u2013384 (2002)"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N.: Computational Complexity and the Game Theory Approach to Cost Allocation for a Tree. Mathematics of Operations Research\u00a03, 189\u2013196 (1978)","journal-title":"Mathematics of Operations Research"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: STOC 2001, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On Complexity as Bounded Rationality (Extended Abstract). In: STOC 1994, pp. 726\u2013733 (1994)","DOI":"10.1145\/195058.195445"},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF03025291","volume":"20","author":"S. Smale","year":"1998","unstructured":"Smale, S.: Mathematical Problems for the Next Century. Mathematical Intelligencer\u00a020(2), 7\u201315 (1998)","journal-title":"Mathematical Intelligencer"},{"key":"29_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. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:53Z","timestamp":1605741833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_29","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}