{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:01:20Z","timestamp":1773082880334,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540771043","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_26","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:59:37Z","timestamp":1196647177000},"page":"269-280","source":"Crossref","is-referenced-by-count":3,"title":["Stochastic Mechanism Design"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Ieong","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Man-Cho So","sequence":"additional","affiliation":[]},{"given":"Mukund","family":"Sundararajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0899-8256(03)00176-3","volume":"47","author":"A.. Archer","year":"2004","unstructured":"Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior\u00a047, 36\u201371 (2004)","journal-title":"Games and Economic Behavior"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bergemann, D., V\u00e4lim\u00e4ki, J.: Efficient dynamic auctions. Working paper (2006)","DOI":"10.2139\/ssrn.936633"},{"key":"26_CR3","unstructured":"Cavallo, R., Parkes, D.C., Singh, S.: Optimal coordinated planning amongst self-interested agents with private state. In: Proc.\u00a0UAI 2006 (2006)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/11538462_22","volume-title":"Approximation, Randomization and Combinatorial Optimization","author":"M.. Charikar","year":"2005","unstructured":"Charikar, M., Chekuri, C., P\u00e1l, M.: Sampling bounds for stochastic optimization. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 257\u2013269. Springer, Heidelberg (2005)"},{"issue":"3\/4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"G..B. Dantzig","year":"1955","unstructured":"Dantzig, G.B.: Linear programming under uncertainty. Management Science\u00a01(3\/4), 197\u2013206 (1955)","journal-title":"Management Science"},{"issue":"1","key":"26_CR6","first-page":"21","volume":"63","author":"J.. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions. JCSS\u00a063(1), 21\u201341 (2001)","journal-title":"JCSS"},{"key":"26_CR7","volume-title":"Computers and Intractability","author":"M..R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1979)"},{"issue":"4","key":"26_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"},{"key":"26_CR9","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: SODA 2004, pp. 691\u2013700 (2004)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S.. Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. JACM\u00a048, 761\u2013777 (2001)","journal-title":"JACM"},{"key":"26_CR11","volume-title":"Encyclopedia of Life Support Systems","author":"M.. Jackson","year":"2003","unstructured":"Jackson, M.: Mechanism theory. In: Derigs, U. (ed.) Encyclopedia of Life Support Systems, EOLSS Publishers, Oxford, UK (2003)"},{"issue":"1","key":"26_CR12","first-page":"479","volume":"12","author":"J. Anton","year":"2001","unstructured":"Anton, J., Kleywegt, A.J., Shapiro, A., de Mello, T.H.: The sample average approximation method for stochastic discrete optimization. SIAM Journal on Optimization\u00a012(1), 479\u2013502 (2001)","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jalgor.2004.08.002","volume":"58","author":"A.. Mehta","year":"2006","unstructured":"Mehta, A., Shenker, S., Vazirani, V.: Profit-maximizing multicast pricing by approximating fixed points. J. Algorithms\u00a058(2), 150\u2013164 (2006)","journal-title":"J. Algorithms"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proc.\u00a031st STOC, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. In: Proc.\u00a01st EC, pp. 242\u2013252 (2000)","DOI":"10.1145\/352871.352898"},{"issue":"6","key":"26_CR16","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"B. David","year":"2006","unstructured":"David, B., Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. JACM\u00a053(6), 978\u20131012 (2006)","journal-title":"JACM"},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1122480.1122493","volume":"37","author":"C.. Swamy","year":"2006","unstructured":"Swamy, C., Shmoys, D.B.: Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News\u00a037(1), 33\u201346 (2006)","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:23Z","timestamp":1619506823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_26","relation":{},"subject":[]}}