Reduction of Silverman-like games to games on bounded sets

DOI10.1007/BF01248493MaRDI QIDQ1121809zbMATH OpenFDO

Authors Gerald A. Heuer

Publication date 1989

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01248493

zbMATH Keywords

reduction of gamesSilverman-like games

Mathematics Subject Classification ID

2-person games (91A05)

Review text

The paper concerns two-person zero-sum games in which the strategy sets are sets of real numbers bounded from below, payoff functions are bounded, and the achievement of the maximum or minimum payoffs depends on the relation between the strategies (i.e. numbers) chosen by both players. It is shown that for the discrete strategy sets the game can be reduced to a game over finite sets of strategies.

Recommendations

• Balanced Silverman games on general discrete sets
• scientific article; zbMATH DE number 3876959
• Silverman Games on Disjoint Discrete Sets
• Silverman's game on discrete sets
• Silverman's game. A special class of two-person zero-sum games

Cites work

• A family of games on 1,∞)2 with payoff a function ofy/x
• Odds versus evens in Silverman-type games
• Silverman Games on Disjoint Discrete Sets
• Silverman's Game on Intervals

Cited in

(6)

• Silverman's game on discrete sets
• Balanced Silverman games on general discrete sets
• Nonsingularity of some classes of matrices, and minimal solutions of Silverman's game on discrete sets
• The reduced sets: A new solution concept for cooperative games and other decision problems
• scientific article; zbMATH DE number 3987075 (Why is no real title available?)
• The game of Double-Silver on intervals

This page was built for publication: Reduction of Silverman-like games to games on bounded sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121809)