game theory linear programming n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Game theory & Linear Programming PowerPoint Presentation
Download Presentation
Game theory & Linear Programming

Loading in 2 Seconds...

play fullscreen
1 / 16

Game theory & Linear Programming - PowerPoint PPT Presentation


  • 125 Views
  • Uploaded on

Game theory & Linear Programming. Steve Gu Mar 28, 2008. Outline. Background Nash Equilibrium Zero-Sum G ame How to Find NE using LP? Summary. Background: History of Game Theory. John Von Neumann 1903 – 1957. Book - Theory of Games and Economic Behavior. John Forbes Nash 1928 –

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Game theory & Linear Programming' - blossom-hines


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
outline
Outline
  • Background
  • Nash Equilibrium
  • Zero-Sum Game
  • How to Find NE using LP?
  • Summary
background history of game theory
Background: History of Game Theory
  • John Von Neumann 1903 – 1957.
  • Book - Theory of Games and Economic Behavior.
  • John Forbes Nash 1928 –
  • Popularized Game Theory with his Nash Equilibrium (Noble prize).
background prison s dilemma
Background: Prison’s Dilemma

Given you’re Dave, what’s the best choice?

nash equilibrium
Nash Equilibrium

A set of strategies is a Nash equilibrium if no player can do better by changing his or her strategy

nash equilibrium cont
Nash Equilibrium (Cont’)
  • Nash showed (1950), that Nash equilibria (in mixed strategies) must exist for all finite games with any number of players.
  • Before Nash's work, this had been proven for two-player zero-sum games (by John von Neumann and Oskar Morgenstern in 1947).
  • Today, we’re going to find such Nash equilibria using Linear Programming for zero-sum game
zero sum game
Zero-Sum Game
  • A strictly competitive or zero-sum game is a 2-player strategic game such that for each action aA, we have u1(a) + u2(a) = 0. (u represents for utility)
    • What is good for me, is bad for my opponent and vice versa
zero sum game1
Zero-Sum Game
  • Mixed strategy
    • Making choice randomly obeying some kind of probability distribution
  • Why mixed strategy? (Nash Equilibrium)
  • E.g. : P(1) = P(2) = 0.5; P(A) = P(B)=P(C)=1/3
solving zero sum games
Solving Zero-Sum Games
  • Let A1 = {a11, …, a1n }, A2 = {a21, …, a2m }
  • Player 1 looks for a mixed strategy p
    • ∑ip(a1i ) = 1
    • p(a1i ) ≥ 0
    • ∑ip(a1i ) · u1(a1i, a2j) ≥r for all j {1, …, m}
    • Maximize r!
  • Similarly for player 2.
solve using linear programming
Solve using Linear Programming
  • What are the unknowns?
    • Strategy (or probability distribution): p
      • p(a11 ), p(a12 ),..., p(a1n-1 ), p(a1n )~n numbers
      • Denoted as p1,p2,...,pn-1,pn
    • Optimum Utility or Reward: r
  • Stack all unknowns into a column vector
  • Goal: minimize: where
solve zero sum game using lp
Solve Zero-Sum Game using LP
  • What are the constraints?
solve zero sum game using lp1
Solve Zero-Sum Game using LP

Let: Ae=(0,1,…,1)

Aie=(1;-UT)

f=(1,0,…,0)T

The LP is:

maximize fTx

subject to:

Aiex<=0

Aex=1

summary
Summary
  • Zero-Sum Game  Mixed Strategy  NE
  • Connections with Linear Programming