By Topic

Polynomial games and sum of squares optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Parrilo, P.A. ; Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA

We study two-person zero-sum games, where the payoff function is a polynomial expression in the actions of the players. This class of games was introduced by Dresher, Karlin, and Shapley in 1950. We show that the value of the game, and the corresponding optimal strategies, can be obtained by solving a single semidefinite programming problem. In addition, we show how the results extend, with suitable modifications, to a general class of semialgebraic games

Published in:

Decision and Control, 2006 45th IEEE Conference on

Date of Conference:

13-15 Dec. 2006