Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Slides:

Advertisements

Similar presentations

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Advertisements

Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.

Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.

Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.

Game Theory “I Used to Think I Was Indecisive - But Now I’m Not So Sure” - Anonymous Mike Shor Lecture 5.

1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.

The basics of Game Theory Understanding strategic behaviour.

Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.

MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Nash Equilibria By Kallen Schwark 6/11/13 Fancy graphs make everything look more official!

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Language and Coordination. Convention in the Theory of Meaning.

Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.

Games of pure conflict two person constant sum. Two-person constant sum game Sometimes called zero-sum game. The sum of the players’ payoffs is the same,

Game Theory and Applications following H. Varian Chapters 28 & 29.

6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.

1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.

An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.

Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.

Lecture Slides Dixit and Skeath Chapter 4

An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.

Static Games of Complete Information: Subgame Perfection

Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.

EC941 - Game Theory Francesco Squintani Lecture 3 1.

An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.

Starbucks, Beating The Prisoners Dillema Brooke Hatcher Econ 202 April 28 th, 2012.

Introduction to Game Theory

Social Choice Session 7 Carmen Pasca and John Hey.

Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.

Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.

Intermediate Microeconomics

Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.

McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.

Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.

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.

Dominance Since Player I is maximizing her security level, she prefers “large” payoffs. If one row is smaller (element- wise) than another,

The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.

Game Theory, Part 2 Consider again the game that Sol and Tina were playing, but with a different payoff matrix: H T Tina H T Sol.

Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.

Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.

Intermediate Microeconomics Game Theory and Oligopoly.

Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.

Incomplete information: Perfect Bayesian equilibrium

Topics to be Discussed Gaming and Strategic Decisions

GAME THEORY Day 5. Minimax and Maximin Step 1. Write down the minimum entry in each row. Which one is the largest? Maximin Step 2. Write down the maximum.

Cheap Talk. When can cheap talk be believed? We have discussed costly signaling models like educational signaling. In these models, a signal of one’s.

KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson 65 Module.

9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.

Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.

Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.

Game theory Chapter 28 and 29

Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.

Mixed Strategies Keep ‘em guessing.

Microeconomics Course E

Simultaneous Move Games: Discrete Strategies

Games of pure conflict two person constant sum

Communication Complexity as a Lower Bound for Learning in Games

Game theory Chapter 28 and 29

Algorithmic Applications of Game Theory

Lecture Game Theory.

Presentation transcript:

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA

IMPORTANT ANNOUNCEMENT Lectures are MOVING to Pancoe Auditorium. (so we can accommodate more students, tell your friends to join the class!)

The investment game

Experiment: You may invest one of your points in the community. 1. In your envelope is a piece of paper. Write your name and whether you wish to invest or save on the paper. DO NOT SHOW ANYONE. 2. Put the paper in your envelope, pass it to the TAs. We will match the contributions at 50% (hence every invested point becomes 1.5 points) and then redistribute the points evenly among everyone.

Lecture Two: How do we play games?

What is a game? A set of players their possible strategies, and a function relating strategy choices to payoffs.

Im Mrs. Column. Lets play a game! Normal-form games two players Hi, my name is Mr. Row.

Mr. Row Mrs. Column Mr. Row and Mrs. Column each have 4 quarters to invest. 2-player Investment Game

Mr. Row Mrs. Column InvestSave Column strategies 2-player Investment Game

InvestSave Invest Row strategies 2-player Investment Game Mr. Row Mrs. Column

( ?, ? ) InvestSave Invest 2-player Investment Game Mr. Row Mrs. Column Investments

( ?, ? ) InvestSave Invest 2-player Investment Game Mr. Row Mrs. Column Returns ( 3, 7 )

( 6, 6 ) InvestSave Invest Payoff matrix. 2-player Investment Game ( 7, 3 )( 4, 4 ) ( 3, 7 ) Mr. Row Mrs. Column

Game Theory Given a game, can we predict which strategies the players will play?

If Column invests, I am better off not investing. If Column doesnt invest, I am still better off not investing. I SHOULD NOT INVEST! Same here! What should row do? InvestSave Invest Prediction: Players will end up not investing. Mr. Row Mrs. Column ( 6, 6 ) ( 7, 3 )( 4, 4 ) ( 3, 7 )

Conclusion In Investment Game: best strategy is to save,... no matter what other player does. This is a dominant strategy equilibrium.

Conclusion In Investment Game: best strategy is to save,... no matter what other player does,... even though it is highly sub-optimal!

( 6, 6 ) InvestSave Invest Social Optimum ( 7, 3 )( 4, 4 ) ( 3, 7 ) Mr. Row Mrs. Column Social optimum: Each player gets 2 more quarters than in equilibrium!

( 6, 6 ) InvestSave Invest Price of anarchy ( 7, 3 )( 4, 4 ) ( 3, 7 ) Mr. Row Mrs. Column How societal value much is lost due to lack of coordination? Total val. in equil.: 8q Total val. in soc. opt.:12q PoA:2/3

What did we do? Results of our investment game.

Dominant strategies What do you think of this prediction? Dominant Strategy Equilibrium: Each players strategy is her best choice no matter what her opponent does.

John Nash

Movie Time

The dating game Mr. Row Mrs. Column ( 0, 0 ) BlondeBrunettes Blonde ( 1, 2 )( 1, 1 ) ( 2, 1 ) A blonde and two brunettes are sitting in the computer lab …

The dating game If Column goes for the blonde, Row is better off going for the brunette. Mr. Row Mrs. Column ( 0, 0 ) BlondeBrunettes Blonde ( 1, 2 )( 1, 1 ) ( 2, 1 )

The dating game But if Column goes for the brunette, Row definitely wants to go for the blonde. Mr. Row Mrs. Column ( 0, 0 ) BlondeBrunettes Blonde ( 1, 2 )( 1, 1 ) ( 2, 1 )

The dating game There is no dominant strategy equilibrium! Mr. Row Mrs. Column ( 0, 0 ) BlondeBrunettes Blonde ( 1, 2 )( 1, 1 ) ( 2, 1 )

( 0, 0 ) BlondeBrunettes Blonde The dating game ( 1, 2 )( 1, 1 ) ( 2, 1 ) Mr. Row Mrs. Column

How to play the dating game? What did you do?

How to play the dating game? If you think the competition is going to go for the blonde, then go for the brunettes. …but if you think the competition will go for the brunettes, hit on the blonde!

Nash equilibria Each person is playing a mutual best-response. This is a Nash equilibrium.

( 0, 0 ) BlondeBrunette Blonde The dating game ( 1, 2 )( 1, 1 ) ( 2, 1 ) Mr. Row Mrs. Column Equilibria of the dating game Are there any other equilibria?

Time for

( 0, 0 ) BlondeBrunette Blonde The dating game ( 1, 2 )( 1, 1 ) ( 2, 1 ) Mr. Row Mrs. Column Mixed Nash equilibria: Players choose strategies probabilistically. q (1-q) (1-p) p

q (1-q) ( 0, 0 ) BlondeBrunette Blonde The dating game ( 1, 2 )( 1, 1 ) ( 2, 1 ) Mr. Row Mrs. Column Observation: For Row to play both strategies, payoff must be equal. 1/2 (1-p) p

( 0, 0 ) BlondeBrunettes Blonde The dating game ( 1, 2 )( 1, 1 ) ( 2, 1 ) Mr. Row Mrs. Column Observation: For Column to play both strategies, payoff must be equal. 1/2

( 0, 0 ) BlondeBrunettes Blonde The dating game ( 1, 2 )( 1, 1 ) ( 2, 1 ) Mr. Row Mrs. Column Mixed equilibrium: Each player flips a fair coin to decide whether to chat up the blonde or the brunettes. 1/2

Nash Equilibria Nash Equilibrium: Each players strategy is a best-response to the strategies of his opponents. (mixed if playing probabilistically, else pure)

Nash Equilibria What do you think of this prediction?

Objection to Nash equilibria There may be many Nash equilibria.

IMPORTANT ANNOUNCEMENT Lectures are MOVING to Pancoe Auditorium. (so we can accommodate more students, tell your friends to join the class!)

Next time markets * * in Pancoe Auditorium.