This paper studies situations in which companies can cooperate in order to decrease the earliest completion time of a project that consists of several tasks. This is beneficial for the client who wants the project to be completed as early as possible. The client is willing to pay more for an...

In cooperative stochastic dynamic games a stringent condition — subgame consistency — is required for a dynamically stable solution. A cooperative solution is subgame consistent if an extension of the solution policy to a situation with a later starting time and any feasible state brought...

In this note, we give a straightforward and elementary proof of a theorem by Aumann and Maschler stating that in the well-known bankruptcy problem, the so-called CG-consistent solution described by the Talmud represents the nucleolus of the corresponding coalitional game. The proof nicely fits...

We propose a theory of the interaction between knowledge and games. Epistemic game theory is of course a well-developed subject but there is also a need for a theory of how some agents can affect the outcome of a game by affecting the knowledge which other agents have and thereby affecting their...

A linear-quadratic zero-sum singular differential game, where the cost functional does not contain the minimizer's control cost, is considered. Due to the singularity, the game cannot be solved either by applying the MinMax principle of Isaacs, or by using the Bellman–Isaacs equation method....

No abstract received.

In this paper we study and compute E-points in an explicit way for a special general kind of 3k + 1 and 3k + 2 players.

We consider two-player turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve sets of plays in order to express useful constraints on strategies that are not μ-calculus definable. Typically, we can represent constraints on allowed...

The compensation received by economic agents reflects their performance. Usually compensation reflects performance measured cardinally, but sometimes ordinal considerations play a role. It is well established that rewards — cardinal or ordinal — can rationally motivate contestants to put...

The issue of the order dependence of iterative deletion procedures is well known in the game theory community, and conditions on the dominance concept underlying these procedures have meanwhile been detected which ensure order independence (see, e.g., the criteria of Gilboa et al. (1990) and Apt...