We propose a meta-heuristic approach for solving nonlinear dynamic tracking games. In contrast to more "traditional" methods based on linear-quadratic (LQ) techniques, this derivative-free method is very flexible (e.g. to introduce inequality constraints). The meta-heuristic is applied to a...

We propose a meta-heuristic approach for solving nonlinear dynamic tracking games. In contrast to more "traditional" methods based on linear-quadratic (LQ) techniques, this derivative-free method is very flexible (e.g. to introduce inequality constraints). The meta-heuristic is applied to a...

Markov perfection has become the usual solution concept to determine the non-cooperative equilibrium in a dynamic game. However, Markov perfection is a stronger solution concept than subgame perfection: Markov perfection rules out any cooperation in a repeated prisoners' dilemma game because the...

Markov perfection has become the usual solution concept to determine the non-cooperative equilibrium in a dynamic game. However, Markov perfection is a stronger solution concept than subgame perfection: Markov perfection rules out any cooperation in a repeated prisoners' dilemma game because the...

Many water allocation agreements in transboundary river basins are inherently unstable. Due to stochastic river flow, agreements may be broken in case of drought. The objective of this paper is to analyze whether water allocation agreements can be self-enforcing, or sustainable. We do so using...

Using non-cooperative game theory the effects of mediation on the divorce rate and on the utility of the spouses are analysed. Two kinds of mediation are considered: restricted mediation that reduces the costs of divorce and extended mediation that additionally may prevent divorces by...

We consider a dynamic version of sender-receiver games, where the sequence of states follows an irreducible Markov chain observed by the sender. Under mild assumptions, we provide a simple characterization of the limit set of equilibrium payoffs, as players become very patient. Under these...

Although many signaling situations are best interpreted as repeated games, prior research often models them as one-shot games. We analyze a class of repeated signaling games in which the informed player's type is persistent and the history of actions are perfectly observable. In this context a...

We consider a dynamic version of sender–receiver games, where the sequence of states follows an irreducible Markov chain observed by the sender. Under mild assumptions, we provide a simple characterization of the limit set of equilibrium payoffs, as players become very patient. Under these...