Game Theory: Whirlwind Review Matrix (normal form) games, mixed strategies, Nash equil. –the basic objects of vanilla game theory –the power of private.

Slides:



Advertisements
Similar presentations
A Local Mean Field Analysis of Security Investments in Networks Marc Lelarge (INRIA-ENS) Jean Bolot (SPRINT) NetEcon 2008.
Advertisements

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Introduction to Game Theory Networked Life CSE 112 Spring 2005 Prof. Michael Kearns.
News and Notes 4/13 HW 3 due now HW 4 distributed today, due Thu 4/22 Final exam is Mon May 3 11 AM Levine 101 Today: –intro to evolutionary game theory.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Geoffrey Heal Graduate School of Business Columbia University Howard Kunreuther Center for Risk Management.
Games With No Pure Strategy Nash Equilibrium Player 2 Player
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
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.
AP Economics Mr. Bernstein Module 65: Game Theory December 10, 2014.
Regret Minimization and the Price of Total Anarchy Paper by A. Blum, M. Hajiaghayi, K. Ligett, A.Roth Presented by Michael Wunder.
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Network Security An Economics Perspective IS250 Spring 2010 John Chuang.
Geoffrey Heal Graduate School of Business Columbia University Howard Kunreuther Center for Risk Management.
Interdependent Security Games and Networks Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
Managerial Economics and Organizational Architecture, 5e Chapter 9: Economics of Strategy: Game Theory McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
0 Network Effects in Coordination Games Satellite symposium “Dynamics of Networks and Behavior” Vincent Buskens Jeroen Weesie ICS / Utrecht University.
Strategic Models of Network Formation Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
From Local Incentives to Global Outcomes Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Autonomous Target Assignment: A Game Theoretical Formulation Gurdal Arslan & Jeff Shamma Mechanical and Aerospace Engineering UCLA AFOSR / MURI.
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.
Nash Q-Learning for General-Sum Stochastic Games Hu & Wellman March 6 th, 2006 CS286r Presented by Ilan Lobel.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Economic Models of Network Formation Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
Simulating Normal Random Variables Simulation can provide a great deal of information about the behavior of a random variable.
1 Howard Kunreuther Center for Risk Management and Decision Processes The Wharton School University of Pennsylvania CIS620/OPIM952.
Graphical Games Kjartan A. Jónsson. Nash equilibrium Nash equilibrium Nash equilibrium N players playing a dominant strategy is a Nash equilibrium N players.
Economic Models of Network Formation Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Introduction to Game Theory and Networks Networked Life CSE 112 Spring 2007 Prof. Michael Kearns.
Introduction to Game Theory, Behavior and Networks Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
Learning dynamics,genetic algorithms,and corporate takeovers Thomas H. Noe,Lynn Pi.
MAKING COMPLEX DEClSlONS
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
Assoc. Prof. Yeşim Kuştepeli1 GAME THEORY AND APPLICATIONS UNCERTAINTY AND EXPECTED UTILITY.
Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Network Economics: two examples Marc Lelarge (INRIA-ENS) SIGMETRICS, London June 14, 2012.
Introduction to Game Theory and Strategic Behavior Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns.
Some Analysis of Coloring Experiments and Intro to Competitive Contagion Assignment Prof. Michael Kearns Networked Life NETS 112 Fall 2014.
Microeconomics Course E John Hey. Examinations Go to Read.
Dynamic Games & The Extensive Form
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
UNCERTAINTY AND EXPECTED UTILITY Prof. Dr. Yeşim Kuştepeli ECO 4413 Game Theory 1.
Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
Computing and Approximating Equilibria: How… …and What’s the Point? Yevgeniy Vorobeychik Sandia National Laboratories.
Chapter 10: Games and Strategic Behavior
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013.
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland.
Lec 23 Chapter 28 Game Theory.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
On a Network Creation Game
Trading in Networks: I. Model
Introduction to (Networked) Game Theory
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Convergence, Targeted Optimality, and Safety in Multiagent Learning
Introduction to (Networked) Game Theory
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
نسیم لحیم‌گرزاده استاد درس: دکتر فرزاد توحیدخواه
Introduction to (Networked) Game Theory
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Normal Form (Matrix) Games
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Game Theory: Whirlwind Review Matrix (normal form) games, mixed strategies, Nash equil. –the basic objects of vanilla game theory –the power of private randomization Repeated matrix games –the power of shared history –new equilibria may result Correlated equilibria –the power of shared randomization –new equilibria may result –the result of adaptation and learning by players Axiomatic approaches –to bargaining –to voting and social choice

Games on Networks Matrix game “networks” Vertices are the players Keeping the normal (tabular) form –is expensive (exponential in N) –misses the point Most strategic/economic settings have much more structure –asymmetry in connections –local and global structure –special properties of payoffs Two broad types of structure: –special structure of the network e.g. geographically local connections –special global payoff functions e.g. financial markets

Interdependent Security Games and Networks Networked Life CSE 112 Spring 2004 Prof. Michael Kearns

The Airline Security Problem Imagine an expensive new bomb-screening technology –large cost C to invest in new technology –cost of a mid-air explosion: L >> C There are two sources of explosion risk to an airline: –risk from directly checked baggage: new technology can reduce this –risk from transferred baggage: new technology does nothing –transferred baggage not re-screened (except for El Al airlines) This is a “game”… –each player (airline) must choose between I(nvesting) or N(ot) partial investment ~ mixed strategy –(negative) payoff to player (cost of action) depends on all others …on a network –the network of transfers between air carriers –not the complete graph –best thought of as a weighted network

The IDS Model Let x_i be the fraction of the investment C airline i makes Define the cost of this decision x_i as: - (x_i C + (1 – x_i)p_i L + S_i L) S_i: probability of “catching” a bomb from someone else –a straightforward function of all the “neighboring” airlines j –incorporates both their investment decision j and their probability or rate of transfer to airline i Analysis of terms: –x_i C = C at x_i = 1 (full investment); = 0 at x_i = 0 (no investment) –(1-x_i)p_i L = 0 at full investment; = p_i L at no investment –S_i L: has no dependence on x_i What are the Nash equilibria? –fully connected network with uniform transfer rates: full investment or no investment by all parties!

Abstract Features of the Game Direct and indirect sources of risk Investment reduces/eliminates direct risk only Risk is of a catastrophic event (L >> C) –can effectively occur only once May only have incentive to invest if enough others do! Note: much more involved network interaction than info transmittal, message forwarding, search, etc.

Other IDS Settings Fire prevention –catastrophic event: destruction of condo –investment decision: fire sprinkler in unit Corporate malfeasance (Arthur Anderson) –catastrophic event: bankruptcy –“investment” decision: risk management/ethics practice Computer security –catastrophic event: erasure of shared disk –investment decision: upgrade of anti-virus software Vaccination –catastrophic event: contraction of disease –investment decision: vaccination –incentives are reversed in this setting

An Experimental Study Data: –35K N. American civilian flight itineraries reserved on 8/26/02 –each indicates full itinerary: airports, carriers, flight numbers –assume all direct risk probabilities p_i are small and equal –carrier-to-carrier xfer rates used for risk xfer probabilities The simulation: –carrier i begins at random investment level x_i in [0,1] –at each time step, for every carrier i: carrier i computes costs of full and no investment unilaterally adjusts investment level x_i in direction of improvement (gradient)

Network Visualization Airport to airport Carrier to carrier

Results of Simulation least busy carrier most busy carrier Consistent convergence to a mixed equilibrium Larger airlines do not invest at equilibrium! Dynamics of influence in the network sim time  investment 

The Tipping Point least busy carrier most busy carrier Fix (subsidize) 3 largest airlines at full investment Now consistently converge to global, full investment! Largest 2 do not tip; cascading effects Permits consideration of policy issues

Some Obvious Questions Does the carrier transfer network obey the “universals” of social network theory? –small diameter, local clustering, heavy tails, etc. I don’t know, but probably. What generally happens with IDS games on such networks? –Do “connectors” invest or not invest at equilibrium? –Do such networks lead to investing or non-investing equilibria? –Does subsidization of a couple of connectors make everyone invest? I don’t know… but it’s just a matter of time. For standard economic market models, we’ll give answers.