Definable strategies for Games and Equilibria - PowerPoint PPT Presentation

1 / 8
About This Presentation
Title:

Definable strategies for Games and Equilibria

Description:

Games as models for defining the value of information. Definable Strategies ... Nord-East of size (n,m) I plays II plays I plays .... loses! State of the game : ... – PowerPoint PPT presentation

Number of Views:46
Avg rating:3.0/5.0
Slides: 9
Provided by: MDR89
Category:

less

Transcript and Presenter's Notes

Title: Definable strategies for Games and Equilibria


1
Definable strategies for Games and Equilibria
  • Université Paris II
  • Michel de Rougemont
  • mdr_at_lri.fr
  • http//www.lri.fr/mdr
  • Games as models for defining the value of
    information
  • Definable Strategies
  • There are games with inherent difficult equilibria

2
Game theory, Complexity Economy of information
  • Classical Game theory
  • Equibria, Mechanisms
  • Complexity and Computer Science
  • Agents are limited in power
  • Permissive computing
  • Economy of information
  • Models for the Value of information
  • Feasible mechanisms
  • Our contribution
  • Definable strategies,
  • Definable equilibria

3
Classical games
  • Normal forms (2 players)
  • Extensive forms

Prisoners Dilemma
II
I
I
C
D
II
I
II
(2,2)
(6,6)
4
Symbolic Games
  • Nord-East of size (n,m)

I plays II plays I plays .
loses! State of the game Equilibrium
winning strategy Unknown for n,mgt7
distinct! How to restrict players to strategies
computable in polynomial time? FACT
exponential blow in the transformation Symbolic
-gtExtensive -gtNormal Form
5
Nash Equilibria
Prisoners Dilemma
(C,D) gives 0 for I and 4 for II
Def (x,y) is a Nash Equilibrium if none of the
players can make a better decision.
Theorem. There always exists a pair (p,q) which
is a Nash equilibrium. Complexity of Nash ?
If the players are LIMITED, the equilibria
change
6
Definable strategies
  • Finite structure for a game. North-East
  • (1,k,1,.n, lt, ,h1, h2)
  • h1, h2 1,k-gt1,.n. 1,.n
  • Positions I h1(t)(i,j)
  • Positions II h2(t)(i,j)
  • Strategy -gt 1,.n. 1,.n
  • Inductive definition
  • Definition A strategy is First-order if
  • is a first-order.
  • Theorem A strategy is P-computable iff it is
    inductive.
  • Theorem. There are symbolic games where the
    complexity of the equilibria is at any level of
    PH.

7
Value of a formKleinberg,Papadimitriou, Raghavan
2001
Amazon. Do you prefer Books CDs DVDs
www.amazon.com
  • Books
  • CDs
  • Value based on the Shapley value of a
    cooperative game

8
Conclusion
  • Games and Mechanisms
  • Model of permissive computing
  • Value of information
  • Definable strategies
  • Restrict the power of agents
  • Approximation
  • Complexity and Logic help to understand the
    Economy of information
Write a Comment
User Comments (0)
About PowerShow.com