On the first occurrence of strings.
Displaying 61 – 80 of 94
On the general minimax theorem
Hoàng Tụy (1975)
Colloquium Mathematicae
On the hardness of game equivalence under local isomorphism
Joaquim Gabarró, Alina García, Maria Serna (2013)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We introduce a type of isomorphism among strategic games that we call local isomorphism. Local isomorphisms is a weaker version of the notions of strong and weak game isomorphism introduced in [J. Gabarro, A. Garcia and M. Serna, Theor. Comput. Sci. 412 (2011) 6675–6695]. In a local isomorphism it is required to preserve, for any player, the player’s preferences on the sets of strategy profiles that differ only in the action selected by this player. We show that the game isomorphism problem for...
On the necessary condition for the optimality of control in the problem of evasion in differential games
B. Florkiewicz (1983)
Applicationes Mathematicae
On the numerical resolution of Isaac's inequalities
Silvia C. Di Marco (1997)
RAIRO - Operations Research - Recherche Opérationnelle
On the open-open game
Peg Daniels, Kenneth Kunen, Haoxuan Zhou (1994)
Fundamenta Mathematicae
We modify a game due to Berner and Juhász to get what we call “the open-open game (of length ω)”: a round consists of player I choosing a nonempty open subset of a space X and II choosing a nonempty open subset of I’s choice; I wins if the union of II’s open sets is dense in X, otherwise II wins. This game is of interest for ccc spaces. It can be translated into a game on partial orders (trees and Boolean algebras, for example). We present basic results and various conditions under which I or II...
On the optimal strategy in a random game.
Jonasson, Johan (2004)
Electronic Communications in Probability [electronic only]
On the periodicity of genus sequences of quaternary games.
Allen , M.R. (2007)
Integers
On the possibilities of fuzzification of the solution in fuzzy cooperative games.
Milan Mares (2002)
Mathware and Soft Computing
Some possibilities of fuzzification of the von Neumann-Morgenstern solution of cooperative games with transferable utility (TU games) are briefly investigated. The fuzzification based on the transformation of individual fuzzy TU game into a fuzzy class of (deterministic) TU games with their own specific solutions is discussed.
On the problem in max algebra: every system of intervals is a spectrum
Sergeĭ Sergeev (2011)
Kybernetika
We consider the two-sided eigenproblem over max algebra. It is shown that any finite system of real intervals and points can be represented as spectrum of this eigenproblem.
On the structure of Nash equilibrium sets in partially convex games.
Asche, Matthias (1997)
Journal of Convex Analysis
On the structure of the core of balanced games
Anton Stefanescu (2001)
Kybernetika
The uniform competitive solutions (u.c.s.) are basically stable sets of proposals involving several coalitions which are not necessarily disjoint. In the general framework of NTU games, the uniform competitive solutions have been defined in two earlier papers of the author (Stefanescu [5]) and Stefanescu [6]). The general existence results cover most situations formalized in the framework of the cooperative game theory, including those when the coalitional function is allowed to have empty values....
On the symmetry axiom for values of nonatomic games.
Monderer, Dov, Ruckle, William H. (1990)
International Journal of Mathematics and Mathematical Sciences
On three-rowed chomp.
Brouwer, Andries E., Horváth, Gábor, Molnár-Sáska, Ildikó, Szabó, Csaba (2005)
Integers
On totally bounded games
Ryszard Kretkowski, Rastislav Telgársky (1983)
Mathematica Slovaca
On two combination rules for 0-1-sequences.
Stadje, Wolfgang (1996)
Bulletin of the Belgian Mathematical Society - Simon Stevin
On two problems regarding the Hamiltonian cycle game.
Hefetz, Dan, Stich, Sebastian (2009)
The Electronic Journal of Combinatorics [electronic only]
On two-point Nash equilibria in bimatrix games with convexity properties
Wojciech Połowczuk (2006)
Applicationes Mathematicae
This paper considers bimatrix games with matrices having concavity properties. The games described by such payoff matrices well approximate two-person non-zero-sum games on the unit square, with payoff functions F₁(x,y) concave in x for each y, and/or F₂(x,y) concave in y for each x. For these games it is shown that there are Nash equilibria in players' strategies with supports consisting of at most two points. Also a simple search procedure for such Nash equilibria is given.
On winning fast in Avoider-Enforcer games.
Barát, János, Stojaković, Miloš (2010)
The Electronic Journal of Combinatorics [electronic only]
On ɛ-optimal strategies in discounted Markov games
Heinz-Uwe Kuenle (1985)
Banach Center Publications