Optimal Sets for Games Over the Square

Abstract

It is shown that every non-void weak* closed convex set of distributions on the unit interval is the set of all optimal strategies for one player in some game with continuous payoff over the square.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 25, 1952
Accession Number
ADA596154

Entities

People

  • I. Glicksberg
  • O. Gross

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Convex Sets
  • Corporations
  • Information Operations
  • Intervals
  • Sequences
  • Topology
  • Zero-Sum Games

Fields of Study

  • Economics
  • Mathematics

Readers

  • Game Theory.
  • Graph Algorithms and Convex Optimization.