Graphical game theory: Difference between revisions

Revision as of 12:00, 23 May 2013

Revision as of 17:52, 20 September 2014

Line 4:

==Formal definition==

A graphical game is represented by a graph <math>G</math>, in which each player is represented by a node, and there is an edge between two nodes <math>i</math> and <math>j</math> iff their utility functions are depended on the strategy which the other player will choose . EachEh node <math>i</math> in <math>G</math> has a function <math>u_{i}:\{1\ldots m\}^{d_{i}+1}\rightarrow\mathbb{R}</math>, where <math>d_i</math> is the degree of vertex <math>i</math>. <math>u_{i}</math> specifies the utility of player <math>i</math> as a function of his strategy as well as those of his neighbors.

==The size of the game's representation==