Symmetric Simple Games

Abstract

A symmetric simple game is an n-person in which the winning coalitions are the coalitions of at least k players. All von Neumann- Morgenstern stable sets, in which (n-k) players are discriminated, are characterized for these games.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1973
Accession Number
AD0757354

Entities

People

  • Robert J. Weber

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Cooperative Games
  • Engineering
  • Game Theory
  • Governments
  • Military Research
  • New York
  • Operations Research
  • Symmetric Games
  • Theorems
  • United States
  • United States Government
  • Universities

Fields of Study

  • Economics

Readers

  • Game Theory.