On the game of Banach and Mazur
S. Zubrzycki (1957)
Colloquium Mathematicae
Similarity:
S. Zubrzycki (1957)
Colloquium Mathematicae
Similarity:
Ferguson, Thomas S. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
John E. Walsh, Grace J. Kelleher (1970)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Gloria Fiestras-Janeiro, Ignacio García Jurado (1991)
Qüestiió
Similarity:
In this paper we study some properties concerning the equilibrium point of a bimatrix game and describe a geometric method to obtain all the equilibria of a bimatrix game when one of the players has at most three pure strategies.
Spasoje Mučibabić (2006)
The Yugoslav Journal of Operations Research
Similarity:
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
S. Trybuła (1991)
Applicationes Mathematicae
Similarity:
Hans Keiding (2006)
Banach Center Publications
Similarity:
The aspiration core of a TU game was introduced by Bennett [1] as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of...
Jean-Michel Coulomb (1997)
ESAIM: Probability and Statistics
Similarity:
J. M. Lasry, J. M. Morel, S. Solimini (1989)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
We give a formalization of the ?knowledge games? which allows to study their decidability and convergence as a problem of mathematics. Our approach is based on a metalemma analogous to those of Von Neumann and Morgenstern at the beginning of Game Theory. We are led to definitions which characterize the knowledge games as objects is standard set theory. We then study rigorously the most classical knowledge games and, although we also prove that the ?common knowledge? in these games may...
Flammenkamp, Achim, Holshouser, Arthur, Reiter, Harold (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jakub Jan Golik (2018)
Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia
Similarity:
The main goal of the following article is to design an improved version of the negotiation game created by prof. Alan Fowler (Fowler, 1997). I have tried to achieve this by constructing four separate versions of the game which represent different approaches while preserving rules, chosen basic technical assumptions and the simplicity of the base game. Each version of the game is supposed to i.a. make it less obvious, create new negotiation possibilities (including potential cooperation),...