{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:44Z","timestamp":1750308044522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,11]],"date-time":"2006-06-11T00:00:00Z","timestamp":1149984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,11]]},"DOI":"10.1145\/1134707.1134724","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"150-159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Playing games in many possible worlds"],"prefix":"10.1145","author":[{"given":"Matt","family":"Lepinski","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA"}]},{"given":"David","family":"Liben-Nowell","sequence":"additional","affiliation":[{"name":"Carleton College, Northfield, MN"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}]},{"given":"April Rasala","family":"Lehman","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA"}]}],"member":"320","published-online":{"date-parts":[[2006,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"88","volume-title":"Proceedings of the Symposium on Discrete Algorithms","author":"Archer Aaron","year":"2003","unstructured":"Aaron Archer and David P. Williamson . Faster approximation algorithms for the minimum latency problem . In Proceedings of the Symposium on Discrete Algorithms , pages 88 -- 96 , 2003 . Aaron Archer and David P. Williamson. Faster approximation algorithms for the minimum latency problem. In Proceedings of the Symposium on Discrete Algorithms, pages 88--96, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/0304-4068(74)90037-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.2307\/1911154"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1111\/1468-0262.00317"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1287\/moor.27.4.819.297"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/195058.195125"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/571825.571852"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1006\/jcss.2002.1828"},{"key":"e_1_3_2_1_10_1","volume-title":"Electronic Colloquium on Computational Complexity","author":"Chen Xi","year":"2005","unstructured":"Xi Chen and Xiaotie Deng . 3-NASH is PPAD-complete . In Electronic Colloquium on Computational Complexity , 2005 . Xi Chen and Xiaotie Deng. 3-NASH is PPAD-complete. In Electronic Colloquium on Computational Complexity, 2005."},{"key":"e_1_3_2_1_11_1","volume-title":"Electronic Colloquium on Computational Complexity","author":"Chen Xi","year":"2005","unstructured":"Xi Chen and Xiaotie Deng . Settling the complexity of 2-player Nash-equilibrium . In Electronic Colloquium on Computational Complexity , 2005 . Xi Chen and Xiaotie Deng. Settling the complexity of 2-player Nash-equilibrium. In Electronic Colloquium on Computational Complexity, 2005."},{"key":"e_1_3_2_1_12_1","volume-title":"Auctions and information acquisition: Sealed-bid or dynamic formats? Technical report","author":"Compte Olivier","year":"2002","unstructured":"Olivier Compte and Philippe Jehiel . Auctions and information acquisition: Sealed-bid or dynamic formats? Technical report , Centre d'Enseignement et de Recherche en Analyse Socio-\u00e9conomique, 2002 . Olivier Compte and Philippe Jehiel. Auctions and information acquisition: Sealed-bid or dynamic formats? Technical report, Centre d'Enseignement et de Recherche en Analyse Socio-\u00e9conomique, 2002."},{"key":"e_1_3_2_1_13_1","first-page":"765","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Conitzer Vincent","year":"2003","unstructured":"Vincent Conitzer and Tuomas Sandholm . Complexity results about Nash equilibria . In Proceedings of the International Joint Conference on Artificial Intelligence , pages 765 -- 771 , 2003 . Vincent Conitzer and Tuomas Sandholm. Complexity results about Nash equilibria. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 765--771, 2003."},{"key":"e_1_3_2_1_14_1","volume-title":"April","author":"Cornuejols Gerard","year":"1977","unstructured":"Gerard Cornuejols , Marshall L. Fisher , and George L. Nemhauser . Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23(8) , April 1977 . Gerard Cornuejols, Marshall L. Fisher, and George L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23(8), April 1977."},{"key":"e_1_3_2_1_15_1","first-page":"566","article-title":"Gathering information before signing a contract","volume":"82","author":"Cr\u00e9mer Jacques","year":"1992","unstructured":"Jacques Cr\u00e9mer and Fahad Khalil . Gathering information before signing a contract . American Economic Review , 82 : 566 -- 578 , 1992 . Jacques Cr\u00e9mer and Fahad Khalil. Gathering information before signing a contract. American Economic Review, 82:566--578, 1992.","journal-title":"American Economic Review"},{"key":"e_1_3_2_1_16_1","volume-title":"Electronic Colloquium on Computational Complexity","author":"Daskalakis Constantinos","year":"2005","unstructured":"Constantinos Daskalakis , Paul W. Goldberg , and Christos H. Papadimitriou . The complexity of computing a Nash equilbrium . In Electronic Colloquium on Computational Complexity , 2005 . Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a Nash equilbrium. In Electronic Colloquium on Computational Complexity, 2005."},{"key":"e_1_3_2_1_17_1","volume-title":"Electronic Colloquium on Computational Complexity","author":"Daskalakis Konstantinos","year":"2005","unstructured":"Konstantinos Daskalakis and Christos H. Papadimitriou . Three-player games are hard . In Electronic Colloquium on Computational Complexity , 2005 . Konstantinos Daskalakis and Christos H. Papadimitriou. Three-player games are hard. In Electronic Colloquium on Computational Complexity, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/s10107-003-0414-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1126\/science.1121629"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/AAMAS.2004.67"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_22_1","volume-title":"Multi-stage Information Acquisition in Auction Design. Senior thesis","author":"Fong Kyna","year":"2003","unstructured":"Kyna Fong . Multi-stage Information Acquisition in Auction Design. Senior thesis , Harvard College , 2003 . Kyna Fong. Multi-stage Information Acquisition in Auction Design. Senior thesis, Harvard College, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/195058.195448"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.5555\/795662.796296"},{"key":"e_1_3_2_1_25_1","volume-title":"Game Theory. MIT","author":"Fudenberg Drew","year":"1991","unstructured":"Drew Fudenberg and Jean Tirole . Game Theory. MIT , 1991 . Drew Fudenberg and Jean Tirole. Game Theory. MIT, 1991."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/BF01585867"},{"key":"e_1_3_2_1_27_1","volume-title":"Electronic Colloquium on Computational Complexity","author":"Paul","year":"2005","unstructured":"Paul W. Goldberg and Christos H. Papadimitriou. Reducibility among equilibrium problems . In Electronic Colloquium on Computational Complexity , 2005 . Paul W. Goldberg and Christos H. Papadimitriou. Reducibility among equilibrium problems. In Electronic Colloquium on Computational Complexity, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/BF02579273"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.5555\/874063.875569"},{"key":"e_1_3_2_1_30_1","volume-title":"National Conference on Artificial Intelligence (AAAI)","author":"Hansen Eric A.","year":"2004","unstructured":"Eric A. Hansen , Daniel S. Bernstein , and Shlomo Zilberstein . Dynamic programming for partially observable stochastic games . In National Conference on Artificial Intelligence (AAAI) , 2004 . Eric A. Hansen, Daniel S. Bernstein, and Shlomo Zilberstein. Dynamic programming for partially observable stochastic games. In National Conference on Artificial Intelligence (AAAI), 2004."},{"key":"e_1_3_2_1_31_1","volume-title":"Games with incomplete information played by \"Bayesian\" players. Management Science, 14(3,5,7)","author":"Harsanyi John C.","year":"1967","unstructured":"John C. Harsanyi . Games with incomplete information played by \"Bayesian\" players. Management Science, 14(3,5,7) , 1967 --1968. John C. Harsanyi. Games with incomplete information played by \"Bayesian\" players. Management Science, 14(3,5,7), 1967--1968."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1287\/moor.14.1.18"},{"key":"e_1_3_2_1_33_1","first-page":"151","volume-title":"Uncertainty in Artificial Intelligence","author":"Horvitz Eric","year":"1991","unstructured":"Eric Horvitz and Geoffrey Rutledge . Time-dependent utility and action under uncertainty . In Uncertainty in Artificial Intelligence , pages 151 -- 158 , 1991 . Eric Horvitz and Geoffrey Rutledge. Time-dependent utility and action under uncertainty. In Uncertainty in Artificial Intelligence, pages 151--158, 1991."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.4324\/9780203290644"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1037\/0022-3514.79.6.995"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1016\/B978-0-12-370182-4.50010-6"},{"key":"e_1_3_2_1_37_1","first-page":"10","volume-title":"Proceedings of the Symposium on Discrete Algorithms","author":"Kannan Sampath","year":"2003","unstructured":"Sampath Kannan and Sanjeev Khanna . Selection with monotone comparison costs . In Proceedings of the Symposium on Discrete Algorithms , pages 10 -- 17 , 2003 . Sampath Kannan and Sanjeev Khanna. Selection with monotone comparison costs. In Proceedings of the Symposium on Discrete Algorithms, pages 10--17, 2003."},{"key":"e_1_3_2_1_38_1","first-page":"244","article-title":"A polynomial algorithm in linear programming","author":"Khachiyan L.G.","year":"1979","unstructured":"L.G. Khachiyan . A polynomial algorithm in linear programming . Dokklady Akademiia Nauk SSSR , 244 , 1979 . L.G. Khachiyan. A polynomial algorithm in linear programming. Dokklady Akademiia Nauk SSSR, 244, 1979.","journal-title":"Dokklady Akademiia Nauk SSSR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1016\/0899-8256(92)90035-Q"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1006\/game.1996.0051"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1016\/S0004-3702(01)00132-1"},{"key":"e_1_3_2_1_43_1","volume-title":"Proceedings of the Theoretical Aspects of Rationality and Knowledge","author":"Larson Kate","year":"2001","unstructured":"Kate Larson and Tuomas Sandholm . Costly valuation computation in auctions . In Proceedings of the Theoretical Aspects of Rationality and Knowledge , July 2001 . Kate Larson and Tuomas Sandholm. Costly valuation computation in auctions. In Proceedings of the Theoretical Aspects of Rationality and Knowledge, July 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/988772.988825"},{"key":"e_1_3_2_1_45_1","first-page":"12","article-title":"Equilibrium points of bimatrix games","author":"Lemke C. E.","year":"1964","unstructured":"C. E. Lemke and J. T. Howson , Jr . Equilibrium points of bimatrix games . J. Society for Industrial and Applied Mathematics , 12 , 1964 . C. E. Lemke and J. T. Howson, Jr. Equilibrium points of bimatrix games. J. Society for Industrial and Applied Mathematics, 12, 1964.","journal-title":"J. Society for Industrial and Applied Mathematics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of Neural Information Processing Systems","author":"Littman Michael L.","year":"2001","unstructured":"Michael L. Littman , Michael Kearns , and Satinder Singh . An efficient exact algorithm for singly connected graphical games . In Proceedings of Neural Information Processing Systems , 2001 . Michael L. Littman, Michael Kearns, and Satinder Singh. An efficient exact algorithm for singly connected graphical games. In Proceedings of Neural Information Processing Systems, 2001."},{"key":"e_1_3_2_1_49_1","first-page":"87","volume-title":"Handbook of Compututational Economics","author":"Richard","year":"1996","unstructured":"Richard D. McKelvey and Andrew McLennan. Computation of equilibria in finite games . In H. Amman, D. A. Kendrick, and J. Rust, editors, Handbook of Compututational Economics , volume 1 , pages 87 -- 142 . Elsevier , 1996 . Richard D. McKelvey and Andrew McLennan. Computation of equilibria in finite games. In H. Amman, D. A. Kendrick, and J. Rust, editors, Handbook of Compututational Economics, volume 1, pages 87--142. Elsevier, 1996."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1137\/0906067"},{"issue":"3","key":"e_1_3_2_1_51_1","article-title":"Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon","volume":"7","author":"Moulin H.","year":"1978","unstructured":"H. Moulin and J.-P. Vial . Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon . International J. Game Theory , 7 ( 3\/4 ), 1978 . H. Moulin and J.-P. Vial. Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon. International J. Game Theory, 7(3\/4), 1978.","journal-title":"International J. Game Theory"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1073\/pnas.36.1.48"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1287\/moor.23.3.513"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1016\/S0022-0000(05)80063-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.1145\/380752.380883"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.1145\/1060590.1060598"},{"key":"e_1_3_2_1_57_1","volume-title":"Proceedings of the Symposium on Discrete Algorithms","author":"Christos","year":"2005","unstructured":"Christos H. Papadimitriou and Tim Roughgarden. Computing equilibria in multiplayer games . In Proceedings of the Symposium on Discrete Algorithms , 2005 . Christos H. Papadimitriou and Tim Roughgarden. Computing equilibria in multiplayer games. In Proceedings of the Symposium on Discrete Algorithms, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1145\/195058.195445"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_59_1","DOI":"10.1007\/s10472-005-4692-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_60_1","DOI":"10.1111\/1468-0262.00096"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_61_1","DOI":"10.1007\/BF01769767"},{"key":"e_1_3_2_1_62_1","volume-title":"Strategic implications of uncertainty over one's own private value in auctions. Technical report","author":"Rasmussen Eric","year":"2005","unstructured":"Eric Rasmussen . Strategic implications of uncertainty over one's own private value in auctions. Technical report , Indiana University , 2005 . Eric Rasmussen. Strategic implications of uncertainty over one's own private value in auctions. Technical report, Indiana University, 2005."},{"key":"e_1_3_2_1_63_1","volume-title":"Mid-auction information acquisition. Technical report","author":"Rezende Leonardo","year":"2005","unstructured":"Leonardo Rezende . Mid-auction information acquisition. Technical report , University of Illinois , 2005 . Leonardo Rezende. Mid-auction information acquisition. Technical report, University of Illinois, 2005."},{"key":"e_1_3_2_1_64_1","volume-title":"MIT","author":"Rubinstein Ariel","year":"1988","unstructured":"Ariel Rubinstein . Modeling Bounded Rationality . MIT , 1988 . Ariel Rubinstein. Modeling Bounded Rationality. MIT, 1988."},{"key":"e_1_3_2_1_65_1","volume-title":"Ecco","author":"Schwartz Barry","year":"2004","unstructured":"Barry Schwartz . The Paradox of Choice: Why More is Less . Ecco , 2004 . Barry Schwartz. The Paradox of Choice: Why More is Less. Ecco, 2004."},{"key":"e_1_3_2_1_66_1","volume-title":"MIT","author":"Simon Herbert","year":"1982","unstructured":"Herbert Simon . Models of Bounded Rationality . MIT , 1982 . Herbert Simon. Models of Bounded Rationality. MIT, 1982."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_67_1","DOI":"10.1177\/002224379202900301"},{"key":"e_1_3_2_1_68_1","first-page":"185","volume-title":"Proceedings of the Theoretical Aspects of Rationality and Knowledge","author":"Skyrms Brian","year":"1990","unstructured":"Brian Skyrms . Dynamic models of deliberation and the theory of games . In Proceedings of the Theoretical Aspects of Rationality and Knowledge , pages 185 -- 200 , 1990 . Brian Skyrms. Dynamic models of deliberation and the theory of games. In Proceedings of the Theoretical Aspects of Rationality and Knowledge, pages 185--200, 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_69_1","DOI":"10.5555\/551283"},{"key":"e_1_3_2_1_70_1","volume-title":"Theory of Games and Economic Behavior","author":"von Neumann John","year":"1957","unstructured":"John von Neumann and Oskar Morgenstern . Theory of Games and Economic Behavior . Princeton , 1957 . John von Neumann and Oskar Morgenstern. Theory of Games and Economic Behavior. Princeton, 1957."},{"key":"e_1_3_2_1_71_1","first-page":"1723","volume-title":"Handbook of Game Theory with Econonic Applications","author":"von Stengel Bernhard","year":"2002","unstructured":"Bernhard von Stengel . Computing equilibria for two-person games . In R. J. Aumann and S. Hart, editors, Handbook of Game Theory with Econonic Applications , volume 3 , pages 1723 -- 1759 . Elsevier , 2002 . Bernhard von Stengel. Computing equilibria for two-person games. In R. J. Aumann and S. Hart, editors, Handbook of Game Theory with Econonic Applications, volume 3, pages 1723--1759. Elsevier, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_72_1","DOI":"10.1007\/978-0-585-26870-5_4"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC06","name":"EC06: ACM Conference on Electronic Commerce","location":"Ann Arbor Michigan USA"},"container-title":["Proceedings of the 7th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1134707.1134724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1134707.1134724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:28Z","timestamp":1750259668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1134707.1134724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,11]]},"references-count":69,"alternative-id":["10.1145\/1134707.1134724","10.1145\/1134707"],"URL":"https:\/\/doi.org\/10.1145\/1134707.1134724","relation":{},"subject":[],"published":{"date-parts":[[2006,6,11]]},"assertion":[{"value":"2006-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}