Combinatorial games: Selected bibliography with a succinct gourmet introduction.
Combinatorics of Dyadic Intervals: Consistent Colourings
We study the problem of consistent and homogeneous colourings for increasing families of dyadic intervals. We determine when this problem can be solved and when it cannot.
Combinatorics of open covers (III): games, Cp (X)
Some of the covering properties of spaces as defined in Parts I and II are here characterized by games. These results, applied to function spaces of countable tightness, give new characterizations of countable fan tightness and countable strong fan tightness. In particular, each of these properties is characterized by a Ramseyan theorem.
Combinatorics of open covers (VII): Groupability
We use Ramseyan partition relations to characterize: ∙ the classical covering property of Hurewicz; ∙ the covering property of Gerlits and Nagy; ∙ the combinatorial cardinal numbers and add(ℳ ). Let X be a -space. In [9] we showed that has countable strong fan tightness as well as the Reznichenko property if, and only if, all finite powers of X have the Gerlits-Nagy covering property. Now we show that the following are equivalent: 1. has countable fan tightness and the Reznichenko property. 2....
Compact covering mappings between Borel ѕpaces
Compatibilité entre conduites sociales réelles dans des groupes et les représentations symboliques de ces groupes : un essai de formalisation mathématique
Competitive inventory models
Complementarities and the existence of strong Berge equilibrium
This paper studies the existence and the order structure of strong Berge equilibrium, a refinement of Nash equilibrium, for games with strategic complementarities à la strong Berge. It is shown that the equilibrium set is a nonempty complete lattice. Moreover, we provide a monotone comparative statics result such that the greatest and the lowest equilibria are increasing.
Completing linear differential games by state dependent strategies
Complex dynamics in a nonlinear cobweb model for real estate market.
Complex dynamics of an adnascent-type game model.
Compromise in Cooperative Game and the
Computing the Stackelberg/Nash equilibria using the extraproximal method: Convergence analysis and implementation details for Markov chains games
In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov's regularization method is employed to ensure the convergence of the cost-functions to a Stackelberg/Nash equilibrium point. Then, we transform the problem into a system of equations in the...
Constrained and indefinite games and their applications [Book]
Contractual -core and equilibrium allocations.
Control of a team of mobile robots based on non-cooperative equilibria with partial coordination
In this work we present an application of the concept of non-cooperative game equilibria to the design of a collision free movement of a team of mobile robots in a dynamic environment. We propose the solution to the problem of feasible control synthesis, based on a partially centralized sensory system. The control strategy based on the concept of non-cooperative game equilibria is well known in the literature. It is highly efficient through phases where the solution is unique. However, even in simple...
Convergence method, properties and computational complexity for Lyapunov games
We introduce the concept of a Lyapunov game as a subclass of strictly dominated games and potential games. The advantage of this approach is that every ergodic system (repeated game) can be represented by a Lyapunov-like function. A direct acyclic graph is associated with a game. The graph structure represents the dependencies existing between the strategy profiles. By definition, a Lyapunov-like function monotonically decreases and converges to a single Lyapunov equilibrium point identified by...
Convergence of values in optimal stopping and convergence of optimal stopping times.
Convex interval games.
Convexity of production, common pool and oligopoly games: a survey
The paper surveys a uniform proof technique of the convexity property for three different cooperative TU games arising from three different economical settings. The production economy, common pool situation and oligopoly framework involve a cost function, but different production functions. Each of the three corresponding game theoretic models refers to some maximization problem described by optimizing a certain net profit function over all feasible production levels. The current mathematical proof...