SOLUTIONS OF CONVEX GAMES AS FIXED-POINTS,

Abstract

An optimal strategy of a game is viewed mathematically as a fixed-point in a continuous mapping. Using this interpretation, some general dimensional properties of solutions are derived for games played over arbitrary convex sets. By mapping one convex set onto another, it is shown, with examples, how to compute the solutions of a game. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 12, 1951
Accession Number
AD0603996

Entities

People

  • M. Dresher
  • S. Karlin

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Convex Sets

Fields of Study

  • Mathematics

Readers

  • Game Theory.
  • Graph Algorithms and Convex Optimization.