dc.contributor.author | Izmalkov, Sergei | en_US |
dc.contributor.author | Yildiz, Muhamet | en_US |
dc.coverage.temporal | Fall 2002 | en_US |
dc.date.issued | 2002-12 | |
dc.identifier | 14.126-Fall2002 | |
dc.identifier | local: 14.126 | |
dc.identifier | local: IMSCP-MD5-07e15fb34ed330bb00f573879c461e4f | |
dc.identifier.uri | http://hdl.handle.net/1721.1/35856 | |
dc.description.abstract | How should economic agents act when their optimal decisions depend on what they expect other agents to do? We study various models of equilibrium, which correspond to different ways that the agents might make their decisions, and various kinds of games—static games, dynamic games, and games of incomplete information. | en_US |
dc.format.extent | 13447 bytes | en_US |
dc.format.extent | 12230 bytes | en_US |
dc.format.extent | 39857 bytes | en_US |
dc.format.extent | 22566 bytes | en_US |
dc.format.extent | 48365 bytes | en_US |
dc.format.extent | 11332 bytes | en_US |
dc.format.extent | 11 bytes | en_US |
dc.format.extent | 4586 bytes | en_US |
dc.format.extent | 21366 bytes | en_US |
dc.format.extent | 11602 bytes | en_US |
dc.format.extent | 38351 bytes | en_US |
dc.format.extent | 4755 bytes | en_US |
dc.format.extent | 27322 bytes | en_US |
dc.format.extent | 25313 bytes | en_US |
dc.format.extent | 4039 bytes | en_US |
dc.format.extent | 301 bytes | en_US |
dc.format.extent | 354 bytes | en_US |
dc.format.extent | 339 bytes | en_US |
dc.format.extent | 180 bytes | en_US |
dc.format.extent | 285 bytes | en_US |
dc.format.extent | 67 bytes | en_US |
dc.format.extent | 17685 bytes | en_US |
dc.format.extent | 49 bytes | en_US |
dc.format.extent | 143 bytes | en_US |
dc.format.extent | 247 bytes | en_US |
dc.format.extent | 19283 bytes | en_US |
dc.format.extent | 262 bytes | en_US |
dc.format.extent | 32693 bytes | en_US |
dc.format.extent | 174370 bytes | en_US |
dc.format.extent | 168461 bytes | en_US |
dc.format.extent | 383872 bytes | en_US |
dc.format.extent | 223840 bytes | en_US |
dc.format.extent | 127051 bytes | en_US |
dc.format.extent | 329026 bytes | en_US |
dc.format.extent | 218850 bytes | en_US |
dc.format.extent | 172171 bytes | en_US |
dc.format.extent | 195936 bytes | en_US |
dc.format.extent | 124390 bytes | en_US |
dc.format.extent | 194295 bytes | en_US |
dc.format.extent | 124155 bytes | en_US |
dc.format.extent | 89011 bytes | en_US |
dc.format.extent | 68313 bytes | en_US |
dc.format.extent | 69411 bytes | en_US |
dc.format.extent | 90288 bytes | en_US |
dc.format.extent | 76639 bytes | en_US |
dc.format.extent | 119992 bytes | en_US |
dc.format.extent | 89510 bytes | en_US |
dc.format.extent | 69613 bytes | en_US |
dc.format.extent | 669902 bytes | en_US |
dc.format.extent | 725225 bytes | en_US |
dc.format.extent | 643687 bytes | en_US |
dc.format.extent | 248270 bytes | en_US |
dc.format.extent | 2288413 bytes | en_US |
dc.format.extent | 281632 bytes | en_US |
dc.format.extent | 93061 bytes | en_US |
dc.format.extent | 131669 bytes | en_US |
dc.format.extent | 149852 bytes | en_US |
dc.format.extent | 19283 bytes | en_US |
dc.format.extent | 3486 bytes | en_US |
dc.format.extent | 811 bytes | en_US |
dc.format.extent | 813 bytes | en_US |
dc.format.extent | 830 bytes | en_US |
dc.format.extent | 468 bytes | en_US |
dc.format.extent | 2097 bytes | en_US |
dc.format.extent | 33092 bytes | en_US |
dc.format.extent | 7472 bytes | en_US |
dc.format.extent | 6896 bytes | en_US |
dc.format.extent | 7480 bytes | en_US |
dc.format.extent | 7886 bytes | en_US |
dc.format.extent | 7469 bytes | en_US |
dc.format.extent | 6919 bytes | en_US |
dc.format.extent | 8035 bytes | en_US |
dc.format.extent | 7463 bytes | en_US |
dc.format.extent | 7483 bytes | en_US |
dc.format.extent | 7464 bytes | en_US |
dc.format.extent | 7467 bytes | en_US |
dc.format.extent | 7468 bytes | en_US |
dc.format.extent | 7523 bytes | en_US |
dc.format.extent | 7496 bytes | en_US |
dc.format.extent | 7485 bytes | en_US |
dc.format.extent | 6910 bytes | en_US |
dc.format.extent | 7468 bytes | en_US |
dc.format.extent | 7502 bytes | en_US |
dc.format.extent | 7469 bytes | en_US |
dc.format.extent | 7467 bytes | en_US |
dc.format.extent | 7875 bytes | en_US |
dc.format.extent | 7472 bytes | en_US |
dc.format.extent | 6925 bytes | en_US |
dc.format.extent | 7472 bytes | en_US |
dc.format.extent | 7467 bytes | en_US |
dc.format.extent | 7507 bytes | en_US |
dc.format.extent | 6788 bytes | en_US |
dc.format.extent | 6946 bytes | en_US |
dc.format.extent | 7499 bytes | en_US |
dc.format.extent | 7435 bytes | en_US |
dc.format.extent | 7468 bytes | en_US |
dc.format.extent | 7513 bytes | en_US |
dc.format.extent | 7336 bytes | en_US |
dc.format.extent | 7495 bytes | en_US |
dc.format.extent | 7440 bytes | en_US |
dc.format.extent | 7476 bytes | en_US |
dc.language | en-US | en_US |
dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
dc.subject | game theory | en_US |
dc.subject | Nash Bargaining | en_US |
dc.subject | Price Theory | en_US |
dc.subject | Sequential Bargaining | en_US |
dc.subject | Game theory | en_US |
dc.title | 14.126 Game Theory, Fall 2002 | en_US |
dc.title.alternative | Game Theory | en_US |
dc.type | Learning Object | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Economics | |