We consider a basic stochastic evolutionary model with rare mutation and a best-reply (or better-reply) selection mechanism. Following Young's papers, we call a state stochastically stable if its long-term relative frequency of occurrence is bounded away from zero as the mutation rate decreases...

This research states the stylised n (more than two) players' splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions according to the properties of pertaining...

This paper studies models where the optimal response functions under consideration are non-increasing in endogenous variables, and weakly increasing in exogenous parameters. Such models include games with strategic substitutes, and include cases where additionally, some variables may be...

In a coordination game such as the Battle of the Sexes, agents can condition their plays on external signals that can, in theory, lead to a Correlated Equilibrium that can improve the overall payoffs of the agents. Here we explore whether boundedly rational, adaptive agents can learn to...

This paper examines the behavior of adaptive agents in a stochastic dynamic version of the Hotelling's location model. We conduct an innovative agent-based simulation under the Hotelling's setting with two agents who use the Nash Q-learning mechanism for adaptation. This allows us to explore...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

I consider a class of dynamic Bayesian games in which types evolve stochastically according to a first-order Markov process on a continuous type space. Types are privately informed, but they become public together with actions when payoffs are obtained, resulting in a delayed information...

This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present all...

We establish the existence of pure strategy equilibria in games with discontinuous payoffs where the set of feasible actions of each player varies, also in a discontinuous fashion, as a function of the actions of the other players. Such games are used in modeling abstract economies and other...