Graph continuous function: Difference between revisions

Revision as of 19:50, 16 September 2009

Revision as of 08:14, 18 September 2009

Line 6:

Consider a [[game]] with <math>N</math> agents with agent <math>i</math> having strategy <math>A_i\subseteq\Bbb{R}</math>; write <math>\mathbf{a}</math> for an N-tuple of actions (ie <math>\mathbf{a}\in\prod_{j=1}^NA_j</math>) and <math>\mathbf{a}_{-i}=(a_1,a_2,\ldots,a_{i-1},a_{i+1},\ldots,a_N)</math> as the vector of all agents' actions apart from agent <math>i</math>.

Let <math>U_i:AA_i\longrightarrow\Bbb{R}</math> be the payoff function for agent <math>i</math>.

A '''game''' is defined as <math>[(A_i,U_i); i=1,\ldots,N]</math>.