In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic Riccati equations that play an important role in finding feedback Nash equilibria of the scalar N-player linear affine-quadratic differential game. The algorithm is based on...

We provide several generalizations of the various equilibrium existence results in Reny (1999), Barelli and Meneghel (2013), and McLennan, Monteiro, and Tourky (2011). We also provide an example demonstrating that a natural additional generalization is not possible. All of the theorems yielding...

We explored experimentally how threshold uncertainty affects coordination success in a threshold public goods game. Whereas all groups succeeded in providing the public good when the exact value of the threshold was known, uncertainty was generally detrimental for the public good provision. The...

Existing experimental research on behavior in weakest-link games shows overwhelmingly the inability of people to coordinate on the efficient equilibrium, especially in larger groups. We hypothesize that people are able to coordinate on efficient outcomes, provided they have sufficient freedom to...

The main objects here are Nash equilibria in spatial Cournot oligopolies when profits depend on coordinated distribution. Production is non-cooperative, but the subsequent transportation must be performed jointly to minimize costs. Cournot-Nash equilibria for this two-stage game with partial...

This note characterizes the set A¡∞ of actions of player ¡ that are uniquely rationalizable for some hierarchy of beliefs on an arbitrary space of uncertainty. It is proved that for any rationalizable action a¡ for the type t¡, if a¡ belongs to A¡∞ and is justified by conjectures...

In classical game theory, players have finitely many actions and evaluate outcomes of mixed strategies using a von Neumann-Morgenstern utility function. Allowing a larger, but countable, player set introduces a host of phenomena that are impossible in finite games. Firstly, in coordination...

We show that every finite N-player normal form game possesses a correlated equilibrium with a precise lower bound on the number of outcomes to which it assigns zero probability. In particular, the largest games with a unique fully supported correlated equilibrium are two-player games; moreover,...

In this paper we review a number of algorithms to compute Nash equilibria in deterministic linear quadratic differential games. We will review the open-loop and feedback information case. In both cases we address both the finite and the infinite-planning horizon