Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Similar documents
Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns

Problem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1

Microeconomics of Banking: Lecture 4

THEORY: NASH EQUILIBRIUM

Mixed Strategies; Maxmin

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

LECTURE 26: GAME THEORY 1

ECO 5341 Strategic Behavior Lecture Notes 3

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

Lecture 6: Basics of Game Theory

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1

Lecture #3: Networks. Kyumars Sheykh Esmaili

Analyzing Games: Mixed Strategies

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

Distributed Optimization and Games

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium

2. The Extensive Form of a Game

Grade 7/8 Math Circles. February 14 th /15 th. Game Theory. If they both confess, they will both serve 5 hours of detention.

CMU-Q Lecture 20:

Distributed Optimization and Games

EconS Game Theory - Part 1

CS510 \ Lecture Ariel Stolerman

Computing Nash Equilibrium; Maxmin

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Game Theory: introduction and applications to computer networks

EC3224 Autumn Lecture #02 Nash Equilibrium

Game Theory Week 1. Game Theory Course: Jackson, Leyton-Brown & Shoham. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Week 1

Prisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1)

Lecture 3: Nash Equilibrium

DECISION MAKING GAME THEORY

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

Solution Concepts 4 Nash equilibrium in mixed strategies

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

Dominance and Best Response. player 2

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi

Chapter 30: Game Theory

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

CPS 570: Artificial Intelligence Game Theory

Terry College of Business - ECON 7950

Basic Solution Concepts and Computational Issues

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction

INTRODUCTION TO GAME THEORY

Weeks 3-4: Intro to Game Theory

Game Theory and Randomized Algorithms

Copyright 2008, Yan Chen

Chapter 3 Learning in Two-Player Matrix Games

Introduction to Game Theory I

Advanced Microeconomics: Game Theory

Finance Solutions to Problem Set #8: Introduction to Game Theory

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017

4. Game Theory: Introduction

Multilevel Selection In-Class Activities. Accompanies the article:

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1

Introduction to Game Theory

16.410/413 Principles of Autonomy and Decision Making

ESSENTIALS OF GAME THEORY

Spring 2014 Quiz: 10 points Answer Key 2/19/14 Time Limit: 53 Minutes (FAS students: Teaching Assistant. Total Point Value: 10 points.

Computational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples

1. Introduction to Game Theory

Math 464: Linear Optimization and Game

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.

Game theory Computational Models of Cognition

Introduction to Game Theory

FIRST PART: (Nash) Equilibria

ECO 463. SimultaneousGames

Game Theory. Wolfgang Frimmel. Dominance

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.

ECON 282 Final Practice Problems

3 Game Theory II: Sequential-Move and Repeated Games

Japanese. Sail North. Search Search Search Search

Lecture 13(ii) Announcements. Lecture on Game Theory. None. 1. The Simple Version of the Battle of the Sexes

Instability of Scoring Heuristic In games with value exchange, the heuristics are very bumpy Make smoothing assumptions search for "quiesence"

Computational Methods for Non-Cooperative Game Theory

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.

What is... Game Theory? By Megan Fava

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.

Rationality and Common Knowledge

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Static or simultaneous games. 1. Normal Form and the elements of the game

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Normal Form Games: A Brief Introduction

COORDINATION GAMES. Nash Equilibria, Schelling Points and the Prisoner s Dilemma. Owain Evans, MIT Paradox, Monday 25 February 2013.

Nash Equilibrium. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS 503

Introduction: What is Game Theory?

8.F The Possibility of Mistakes: Trembling Hand Perfection

Chapter 13. Game Theory

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Dominant and Dominated Strategies

Transcription:

Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend 100%

Market Share Dynamics: Polarizing 100% equilibrium: 100% probability of adopting FB unstable equilibrium: 50% Let s also revisit the segregation simulator equilibrium: 0% percent currently using FB (vs. G+) 100%

Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let X denote the average of all the numbers Whoever s number is closest to (2/3)X wins $10 Split in case of ties

Game Theory A mathematical theory designed to model: how rational individuals should behave when individual outcomes are determined by collective behavior strategic behavior Rational usually means selfish --- but not always Rich history, flourished during the Cold War Traditionally viewed as a subject of economics Subsequently applied by many fields evolutionary biology, social psychology now computer science Perhaps the branch of pure math most widely examined outside of the hard sciences

Games for Two Prisoner s Dilemma Chicken Matching Pennies

Prisoner s Dilemma cooperate defect cooperate -1, -1-10, -0.25 defect -0.25, -10-8, -8 Cooperate = deny the crime; defect = confess guilt of both Claim that (defect, defect) is an equilibrium: if I am definitely going to defect, you choose between -10 and -8 so you will also defect same logic applies to me Note unilateral nature of equilibrium: I fix a behavior or strategy for you, then choose my best response Claim: no other pair of strategies is an equilibrium But we would have been so much better off cooperating

Penny Matching heads tails heads 1, 0 0, 1 tails 0, 1 1, 0 What are the equilibrium strategies now? There are none! if I play heads then you will of course play tails but that makes me want to play tails too which in turn makes you want to play heads etc. etc. etc. But what if we can each (privately) flip coins? the strategy pair (1/2, 1/2) is an equilibrium Such randomized strategies are called mixed strategies

The World According to Nash A mixed strategy for a player is a distribution on their available actions e.g. 1/3 rock, 1/3 paper, 1/3 scissors Joint mixed strategy for N players: a probability distribution for each player (possibly different) assume everyone knows all the distributions but the coin flips used to select from player P s distribution known only to P private randomness so only player P knows their actual choice of action can people randomize? (more later) Joint mixed strategy is an equilibrium if: for every player P, their distribution is a best response to all the others i.e. cannot get higher (average or expected) payoff by changing distribution only consider unilateral deviations by each player! Nash 1950: every game has a mixed strategy equilibrium! no matter how many rows and columns there are in fact, no matter how many players there are Thus known as a Nash equilibrium A major reason for Nash s Nobel Prize in economics

Facts about Nash Equilibria While there is always at least one, there might be many zero-sum games: all equilibria give the same payoffs to each player non zero-sum: different equilibria may give different payoffs! Equilibrium is a static notion does not suggest how players might learn to play equilibrium does not suggest how we might choose among multiple equilibria Nash equilibrium is a strictly competitive notion players cannot have pre-play communication bargains, side payments, threats, collusions, etc. not allowed Computing Nash equilibria for large games is difficult

Behavioral Game Theory: What do People Really Do? (Slides adapted from Colin Camerer, CalTech)

Behavioral Game Theory and Game Practice Game theory: how rational individuals should behave Who are these rational individuals? BGT: looks at how people actually behave experiment by setting up real economic situations account for people s economic decisions don t break game theory when it works Fit a model to observations, not rationality

Beauty Contest Analysis Some number of players try to guess a number that is 2/3 of the average guess. The answer can t be between 68 and 100 - no use guessing in that interval. It is dominated. But if no one guesses in that interval, the answer won t be greater than 44. But if no one guesses more than 44, the answer won t be greater than 29 Everyone should guess 0! And good game theorists might But they d lose

Ultimatum Game Proposer has $10 Offers x to Responder (keeps $10-x) What should the Responder do? Self-interest: Take any x > 0 Empirical: Reject x = $2 half the time

How People Ultimatum-Bargain Thousands of games have been played in experiments In different cultures around the world With different stakes With different mixes of men and women By students of different majors Etc. etc. etc. Pretty much always, two things prove true: 1. Player 1 offers close to, but less than, half (40% or so) 2. Player 2 rejects low offers (20% or less)

Ultimatum offers across societies (mean shaded, mode is largest circle )

Behavioral Game Theory: Some Key Themes Bounded Rationality: Humans don t have unlimited computational/reasoning capacity (Beauty Contest) Inequality Aversion: Humans often deviate from equilibrium towards fairness (Ultimatum) Mixed Strategies: Humans can generate random values within limits; better if paid.

Game Theory Review Specify a game by payoffs to each player under all possible joint actions matrix or normal form games Nash equilibrium: choice of actions (a1,a2) for the players such that a1 is a best response to a2, a2 is a best response to a1 (e.g. (confess, confess) in PD) neither player can unilaterally improve their payoff More generally, every player is best-responding to the other N-1 players Nash equilibria always exist; players may need to randomize A static, instantaneous concept no notion of dynamics, repeated or gradual play, learning, etc. Examples so far: small number of players (2) small number of actions per player (e.g. deny or confess) no notion of network

Games on Networks Large number of players Large number of actions Network mediates the interactions between players and payoffs player s payoff depends only on local interactions Don t need exhaustive table to specify payoffs instead specify payoffs for each configuration of the local neighborhood Often consider dynamic, gradual interactions but (Nash) equilibrium still a valuable guide

Example: Schelling s Segregation Model Large number of players: 2500 in demo Large number of actions: all currently empty cells Network mediates the interactions: grid network any player s payoff depends on only their neighboring cells Don t need exhaustive table to specify payoffs payoff = 1 if at least X% like neighbors; else payoff = 0 Often consider dynamic, gradual interactions unhappy (payoff=0) players move to empty cell, may improve payoff simulation converges to a Nash equilibrium (all players payoff=1)

Example: Driving to Work Players are commuters driving to work (large number) each has their own origin and destination wants to minimize their driving time Actions are routes they could take (large number) multiple freeway choices, surface roads, etc. Network of roads intermediates payoffs player s driving time depends only on how many other players are driving same roads cost (= -payoff): sum of latencies on series of roads chosen Very complex game; still has a Nash equilibrium Equivalent to Internet routing How inefficient can the equilibrium outcome be?

Consensus and Coordination in Networks Players are individuals in a social network Actions are simple choices of colors to adopt Social network intermediates payoffs and information only see color choices of your neighbors payoff determined by your color choices and neighbors Consensus: want to agree on common color Differentiation: want to be a different color than neighbors Biased voting: want to agree on a common color, but care which color How does network structure influence individual and collective behavior?

Trading and Bargaining in Networks Players are individuals in a social network Actions are financial trading: barter offers (e.g. trade 1 unit of Milk for 2 units of Wheat) bargaining: proposals for splitting $1 (as in Ultimatum Game) Social network intermediates payoffs and information Can only trade/bargain with your neighbors payoff determined by what deals you strike with neighbors How does network position influence player wealth? What does equilibrium predict, and what do players actually do?

Let s Play A(nother) Networked Game Write Blue on one side of your card and Red on the other The usual subgrid network: you are neighbors with only those in the surrounding 8 seats Make sure you have at least one neighbor and graph is connected You can only talk (quietly) with your neighbors At all times hold your card to your forehead with your current color choice showing You can change your color anytime You can try to persuade your neighbors to change their color If your last name starts with the letters A-L, you prefer Red If your last name starts with the letters M-Z, you prefer Blue Circle your preferred color on your card If within 5 minutes, there is not unanimous agreement of color, you all get nothing If there is unanimous agreement: Those playing their preferred color get a Tootsie Roll and a York Patty! Those playing their non-preferred color get only a Tootsie Roll

Summary Coming lectures examine games and economic interactions on networks Will move back and forth between theory and experimental results Experiments conducted in offline class at University of Pennsylvania Common themes: equilibrium predictions vs. behavior effects of network structure on individual and collective outcome