scientific article; zbMATH DE number 3995480
The paper deals with determinateness of two-person games, whose payoff functions are not necessarily bounded. It is proved that for zero-sum games the existence of value is equivalent to the existence of approximate solutions for any degree of approximation (the approximate solutions are as in the following D1, D2, D3, where \(K_ 2=-K_ 1).\) In the general case, a two-person game \(\Gamma =(X,Y,K_ 1,K_ 2)\) is said to be determined if at least one of the following properties holds: (D1) \(E^{\epsilon_ 1,\epsilon_ 2}\neq \emptyset\), \(\forall \epsilon_ 1,\epsilon_ 2>0\); (D2) \(E^{k,\epsilon}\neq \emptyset\), \(\forall k\in R\), \(\epsilon >0\); (D3) \(E^{\epsilon,k}\neq \emptyset\), \(\forall \epsilon >0\), \(k\in R\); (D4) \(E^{k_ 1,k_ 2}\neq \emptyset\), \(\forall k_ 1,k_ 2\in R.\) The sets \(E^{k,\epsilon}\), e.g., are so defined \((K_ i: X\times Y\to R\), for \(i=1,2):\) \[ E^{k,\epsilon}=\{(\bar x,\bar y)\in X\times Y: K_ 1(\bar x,\bar y)\geq k,\quad K_ 2(\bar x,\bar y)\geq \sup_{y\in Y}K_ 2(\bar x,y)-\epsilon \}. \] Several results are proved about determinateness of mixed extensions of semi-infinite games. In particular, determinateness is proved for the case in which each payoff matrix is either upper or lower bounded.
- Approximate fixed point theorems in Banach spaces with applications in game theory.
- On the IENBR-solvability of two-person finite games
- Zero-sum continuous games with no compact support
- The determinacy of long games
- On the determinateness of semi-infinite bimatrix games
- On the value of some infinite matrix games.
- Determinacy of adversarial Gowers games
- scientific article; zbMATH DE number 4207250 (Why is no real title available?)
- scientific article; zbMATH DE number 4141843 (Why is no real title available?)
- scientific article; zbMATH DE number 3991303 (Why is no real title available?)
- Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
- Characterizing properties of approximate solutions for optimization problems
- Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs
- On finite approximation of a game solution with mixed strategies
- Criterion for complete determinacy for concave-convexlike games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723588)