Zero-sum game

From Theory

Jump to: navigation, search

Notes for CS 8803 - Game Theory and Computer Science. Spring 2008

A constant-sum game, for constant k \in \reals, is simply a game where the sum of the players' payoffs is always k. If G=(N,A, u: A \rightarrow \reals^N) is a normal-form game, then this condition is simply,

\sum_{i=1}^N u_i(a) = k for all a \in A.

A zero-sum game is the special case of a constant-sum game where k = 0.

The production of this material was supported in part by NSF award SES-0734780.

Retrieved from "http://wiki.cc.gatech.edu/theory/index.php/Zero-sum_game"
Personal tools