A noisy duel under arbitrary motion. VIII
Stanisław Trybuła (1995)
Applicationes Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A noisy duel under arbitrary motion. IX”
A noisy duel under arbitrary motion. VIII
A mixed duel under arbitrary motion and uncertain existence of the shot
Stanisław Trybuła (1993)
Applicationes Mathematicae
Similarity:
The purpose of the paper is to solve a mixed duel in which the numbers of shots given to the players are independent 0-1-valued random variables. The players know their distributions as well as the accuracy function P, the same for both players. It is assumed that the players can move as they like and that the maximal speed of the first player is greater than that of the second player. It is shown that the game has a value, and a pair of optimal strategies is found.
A noisy duel under arbitrary motion. VII
Stanisław Trybuła (1995)
Applicationes Mathematicae
Similarity:
Some version of Gowers' dichotomy for Banach spaces.
Pelczar, Anna Maria (2003)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Two variations of the Public Good Index for games with a priori unions
J. Alonso-Meijide, B. Casas-Méndez, M. Fiestras-Janeiro, M. Holler (2010)
Control and Cybernetics
Similarity:
Game-theoretic algorithms for fair and strongly fair cake division with entitlements
Julius Barbanel (1996)
Colloquium Mathematicae
Similarity:
One-point solutions obtained from best approximation problems for cooperative games
Tetsuzo Tanino (2013)
Kybernetika
Similarity:
In this paper we focus on one-point (point-valued) solutions for transferable utility games (TU-games). Since each allocated profit vector is identified with an additive game, a solution can be regarded as a mapping which associates an additive game with each TU-game. Recently Kultti and Salonen proposed a minimum norm problem to find the best approximation in the set of efficient additive games for a given TU-game. They proved some interesting properties of the obtained solution. However,...