A noisy duel under arbitrary moving. V
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
S. Trybuła (1991)
Applicationes Mathematicae
Similarity:
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
S Trybuła (1991)
Applicationes Mathematicae
Similarity:
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
S Trybuła (1991)
Applicationes Mathematicae
Similarity:
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
Pedro Mariano, Luís Correia (2015)
International Journal of Applied Mathematics and Computer Science
Similarity:
We analyse Give and Take, a multi-stage resource sharing game to be played between two players. The payoff is dependent on the possession of an indivisible and durable resource, and in each stage players may either do nothing or, depending on their roles, give the resource or take it. Despite these simple rules, we show that this game has interesting complex dynamics. Unique to Give and Take is the existence of multiple Pareto optimal profiles that can also be Nash equilibria, and a...
A. Zięba (1962)
Studia Mathematica
Similarity:
B. Florkiewicz (1969)
Applicationes Mathematicae
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),...
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...
Witold Rzymowski
Similarity:
CONTENTSIntroduction...........................................................................51. Preliminaries.....................................................................6 1.1. Notation........................................................................6 1.2. Control systems. Strategies..........................................72. Main lemma......................................................................93. Avoidance of many pursuers..........................................14 3.1....
G. Debs, J. Saint Raymond (1996)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity: