Displaying 21 – 40 of 48

Showing per page

Combinatorics of open covers (VII): Groupability

Ljubiša D. R. Kočinac, Marion Scheepers (2003)

Fundamenta Mathematicae

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 T 31 / 2 -space. In [9] we showed that C p ( X ) 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. C p ( X ) has countable fan tightness and the Reznichenko property. 2....

Complementarities and the existence of strong Berge equilibrium

Kerim Keskin, H. Çağrı Sağlam (2014)

RAIRO - Operations Research - Recherche Opérationnelle

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.

Computing the Stackelberg/Nash equilibria using the extraproximal method: Convergence analysis and implementation details for Markov chains games

Kristal K. Trejo, Julio B. Clempner, Alexander S. Poznyak (2015)

International Journal of Applied Mathematics and Computer Science

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...

Control of a team of mobile robots based on non-cooperative equilibria with partial coordination

Krzysztof Skrzypczyk (2005)

International Journal of Applied Mathematics and Computer Science

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

Julio B. Clempner, Alexander S. Poznyak (2011)

International Journal of Applied Mathematics and Computer Science

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...

Convex interval games.

Gök, S.Z.Alparslan, Branzei, R., Tijs, S. (2009)

Journal of Applied Mathematics and Decision Sciences

Convexity of production, common pool and oligopoly games: a survey

Theo S. H. Driessen, Holger Meinhardt (2006)

Banach Center Publications

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...

Conway's Games and Some of their Basic Properties

Robin Nittka (2011)

Formalized Mathematics

We formulate a few basic concepts of J. H. Conway's theory of games based on his book [6]. This is a first step towards formalizing Conway's theory of numbers into Mizar, which is an approach to proving the existence of a FIELD (i.e., a proper class that satisfies the axioms of a real-closed field) that includes the reals and ordinals, thus providing a uniform, independent and simple approach to these two constructions that does not go via the rational numbers and hence does for example not need...

Cooperación y defensa.

Francesc Carreras (1993)

Qüestiió

Se aplican conceptos y técnicas de la teoría de juegos cooperativos a problemas de decisión que afectan a la política de Defensa del país. El análisis permite evaluar las propuestas sobre procedimientos de votación cualificada presentadas al Consejo Europeo en la cumbre de Maastricht de diciembre de 1991. Se ponen así de manifiesto las implicaciones que supondría para la posición estratégica de España la inédita capacidad operativa concedida a la Comunidad por el tratado de unión política.

Cooperative fuzzy games extended from ordinary cooperative games with restrictions on coalitions

Atsushi Moritani, Tetsuzo Tanino, Keiji Tatsumi (2006)

Kybernetika

Cooperative games are very useful in considering profit allocation among multiple decision makers who cooperate with each other. In order to deal with cooperative games in practical situations, however, we have to deal with two additional factors. One is some restrictions on coalitions. This first factor has been taken into consideration through feasibility of coalitions. The other is partial cooperation of players. In order to describe this second factor, we consider fuzzy coalitions which permit...

Currently displaying 21 – 40 of 48