Displaying similar documents to “Payoff space in C 1 -games.”

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.

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,...

Discrete bidding games.

Develin, Mike, Payne, Sam (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity: