Ec1818 Economics of Discontinuous Change Section 1 [Lectures 1-4] Wei Huang Harvard University (Preliminary and subject to revisions)

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Strategic Behavior Game Theory –Players –Strategies –Payoff.
Advertisements

Infinitely Repeated Games
Crime, Punishment, and Forgiveness
Game Theory S-1.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Game Theory “Доверяй, Но Проверяй” (“Trust, but Verify”) - Russian Proverb (Ronald Reagan) Topic 5 Repeated Games.
1 Evolution & Economics No Evolutionary Stability in Repeated Games Played by Finite Automata K. Binmore & L. Samuelson J.E.T Automata.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
Chapter 10 Game Theory and Strategic Behavior
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
An Introduction to... Evolutionary Game Theory
Eponine Lupo.  Questions from last time  3 player games  Games larger than 2x2—rock, paper, scissors  Review/explain Nash Equilibrium  Nash Equilibrium.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
Infinitely Repeated Games Econ 171. Finitely Repeated Game Take any game play it, then play it again, for a specified number of times. The game that is.
Game Theory. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
Automata-based adaptive behavior for economic modeling using game theory Rawan Ghnemat, Khalaf Khatatneh, Saleh Oqeili Al-Balqa’ Applied University, Al-Salt,
Maynard Smith Revisited: Spatial Mobility and Limited Resources Shaping Population Dynamics and Evolutionary Stable Strategies Pedro Ribeiro de Andrade.
Games People Play. 8: The Prisoners’ Dilemma and repeated games In this section we shall learn How repeated play of a game opens up many new strategic.
Institutions and the Evolution of Collective Action Mark Lubell UC Davis.
Satisfaction Equilibrium Stéphane Ross. Canadian AI / 21 Problem In real life multiagent systems :  Agents generally do not know the preferences.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Slide 1 of 13 So... What’s Game Theory? Game theory refers to a branch of applied math that deals with the strategic interactions between various ‘agents’,
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Bertrand Model Game Theory Prisoner’s Dilemma Dominant Strategies Repeated Games Oligopoly and Game Theory.
A Memetic Framework for Describing and Simulating Spatial Prisoner’s Dilemma with Coalition Formation Sneak Review by Udara Weerakoon.
Yale Lectures 21 and Repeated Games: Cooperation vs the End Game.
Evolutionary Game Theory
Lectures in Microeconomics-Charles W. Upton Game Theory.
Why How We Learn Matters Russell Golman Scott E Page.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
Human Social Dilemmas Cooperation Between Non-Relatives Complex Evolutionary Problem Repeated Interaction, Conditional Cooperation Human Cooperation Often.
APEC 8205: Applied Game Theory Fall 2007
Lecture Slides Dixit and Skeath Chapter 4
TOPIC 6 REPEATED GAMES The same players play the same game G period after period. Before playing in one period they perfectly observe the actions chosen.
PRISONER’S DILEMMA By Ajul Shah, Hiten Morar, Pooja Hindocha, Amish Parekh & Daniel Castellino.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Game-Theoretic Models for Effects of Social Embeddedness on Trust and Cooperation Werner Raub Workshop on Social Theory, Trust, Social Networks, and Social.
QR 38 3/15/07, Repeated Games I I.The PD II.Infinitely repeated PD III.Patterns of cooperation.
Performance Analysis of Reputation-based Mechanisms for Multi-hop Wireless Networks Fabio Milan Dipartimento di Elettronica Politecnico di Torino Turin,
Introduction to Game Theory Yale Braunstein Spring 2007.
Segregation and Neighborhood Interaction Work in progress Jason Barr, Rutgers Newark Troy Tassier, Fordham October 31, 2006.
Social Choice Session 7 Carmen Pasca and John Hey.
Dynamic Models of Segregation
Game Theory Formalizing the Hobbesian Dilemma. A. Assumptions 1. Assumptions a. Rational choice – People act according to their preferences (desires,
Punishment and Forgiveness in Repeated Games. A review of present values.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
1 Economics & Evolution Number 3. 2 The replicator dynamics (in general)
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Network Theory: Computational Phenomena and Processes Network Games Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Chapter 12 - Imperfect Competition: A Game-Theoretic Approach Copyright © 2015 The McGraw-Hill Companies, Inc. All rights reserved.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
Chapter 10: Games and Strategic Behavior
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson Micro: Econ: Module.
“Social Capital, Social Mobility” by: Peter Q. Blair.
Section 2 – Ec1818 Jeremy Barofsky
1 GAME THEORY AND OLIGOPOLY l Principles of Microeconomic Theory, ECO 284 l John Eastwood l CBA 247 l l address:
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Introduction to Enviromental Modelling Lecture 1 – Basic Concepts Gilberto Câmara Tiago Carneiro Ana Paula Aguiar Sérgio Costa Pedro Andrade Neto.
C opyright  2007 by Oxford University Press, Inc. PowerPoint Slides Prepared by Robert F. Brooker, Ph.D.Slide 1.
Punishment, Detection, and Forgiveness in Repeated Games.
Lec 23 Chapter 28 Game Theory.
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Game Theory: The Nash Equilibrium
Phase transitions to cooperation in the prisoner‘s dilemma
Presentation transcript:

Ec1818 Economics of Discontinuous Change Section 1 [Lectures 1-4] Wei Huang Harvard University (Preliminary and subject to revisions)

Outline My understanding for this course Key Points in Lecture 1 – 4 – Intuition of Discontinuous Change – Cellular Automata (CA model) – Prisoner‘s Dilemma (PD) and Strategies – Evolutionary Stable Games/Strategies

About This Course, My understanding What’s important – Phenomena, Intuition, Understanding and Applications – I will follow these in Sections Lectures are intuitive and informative, Sections may be somehow more abstract. Role of Mathematics – Helps to understand – Some basic math is required

Intuition of Discontinuous Change Discontinuous Change – Sharp change that affects lives in important ways. – What generates discontinuities? Non-linearities, Positive feedbacks and Interactions. Negative feedbacks can produce stability – D(t) = 100 – W(t) – S(t) = W(t-1) – If W0 = 20, Based on D(t) = S(t), W(t) = 80 – 0.6W(t- 1)… (Next Slide) – Instead, if S(t) = W(t-1), W(t) = 80 – 1.6W(t-1), what will happen?

D or S W(t) or W(t-1) S(t) D(t)

Cellular Automata (CA model) A discrete dynamical system based on a lattice – Behavior depends on near neighbors. The Schelling Model – Neighborhood, Preferences, Moving rules – Complete Math Framework? More complex! Externality may generates segregation beyond what people want! – Many possible outcomes.

An example from Previous PPT

PD and Strategies A B Strategy: A cookbook to follow in any case. For example, Simply “Cooperate” is not a strategy. But “ALWAYS cooperate” or “ALWAYS defect” is a strategy. One important Strategy: Tit-for-Tat (TFT),cooperate until opponent defects, then defect until opponent changes.

Basic calculations We should know how to calculate the payoffs given strategies and the game rules, provided by the matrix. For example, the payoff matrix provided in last slide. – T periods with discount factor w. – What is the payoff to A and B if (All C, All C)? How about (TFT, TFT)? How about (D, D)? – Is (TFT, TFT) a Nash Equilibrium here?

Evolutionary Stable Strategy (ESS) A dominant strategy robust to small invasion by another one strategy. A strategy s is an evolutionary stable strategy (ESS) if, for sufficiently small p > 0, (1-p)U(s, s) + p U(s, t) > (1-p)U(t, s) + p U(t, t) holds, for any other strategy t. “Harm by neighbor” game: – Two Pure Strategy NEs: (A, A), (B, B) – (A, A) does not correspond to ESS but (B, B) does.

Another Example: PD (1) Consider three-period PD repeated game with discount factor 1. The stage game is Consider three strategies: TFT, All C and All D. – U(TFT, TFT) = U(TFT, All C) = U(All C, TFT) = U(All C, All C)=3+3+3 = 9; – U(TFT, All D) = = 2, U(All D, TFT) = = 7 and U(All D, All D) = = 3.

Another Example: PD (2) TFT Strategy is dominant against a small invasion of All D Strategy – (1-p)U(TFT, TFT) + p U(TFT, All D) > (1-p)U(All D, TFT) + p U(All D, All D) holds for all p < 2/3 TFT Strategy is not dominant against a small invasion of All C Strategy – (1-p)U(TFT, TFT) + p U(TFT, All C) = (1-p) U(All C, TFT) + p U(All C, All DC)