A game theoretical analysis of the quantity discount problem with perfect and incomplete information about the buyer's cost structure
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
The algebraic counterpart of the Wagner hierarchy consists of a well-founded and decidable classification of finite pointed ω-semigroups of width 2 and height ωω. This paper completes the description of this algebraic hierarchy. We first give a purely algebraic decidability procedure of this partial ordering by introducing a graph representation of finite pointed ω-semigroups allowing to compute their precise Wagner degrees. The Wagner degree of any ω-rational language can therefore be computed...
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I
The algebraic study of formal languages shows that ω-rational sets correspond precisely to the ω-languages recognizable by finite ω-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ω-rational language to the ω-semigroup context. More precisely, we first show that the Wagner degree is indeed a syntactic invariant. We then define a reduction relation on...
A game-theoretic model of social adaptation in an infinite population
The paper deals with the question of existence and properties of equilibrated distributions of individual characteristics in an infinite population. General game-theoretic methods are applied and special attention is focused on the case of fitness functions depending only on the distance of an individual characteristic from a reference point and from the mean characteristics. Iterative procedures leading to equilibrated distributions are also considered.
A game-theoretical model of competition for staff between two departments
The main purpose of this paper is to analyze a development of a scenario suggested by Baston and Garnaev (2005) for modelling the situation where two departments in a large organization are each seeking to make an appointment within the same area of expertise, for instance, a computer science specialist. The departments are interested in three skills of the candidate (say, writing code, communication and in algorithms). In our scenario Department 1 wants to employ a candidate with excellent skills...
A generalized Amman's fixed point theorem and its application to Nash equlibrium.
A gradient-type algorithm for the numerical solution of two-player zero-sum differential game problems
A graph-theoretic characterization of the core in a homogeneous generalized assignment game
An exchange network is a socioeconomic system in which any two actors are allowed to negotiate and conclude a transaction if and only if their positions-mathematically represented by the points of a connected graph-are joined by a line of this graph. A transaction consists in a bilaterally agreed-on division of a profit pool assigned to a given line. Under the one-exchange rule, every actor is permitted to make no more than one transaction in each negotiation round. Bienenstock and Bonacich ([1])...
A k-noisy, n-silent vs. one-noisy duel with equal accuracy functions
A Markov chain model for traffic equilibrium problems
We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous Markov...
A Markov chain model for traffic equilibrium problems
We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a Markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous...
A mathematical analysis of the card game of betweenies through Kelly's criterion.
A mathematical framework for learning and adaption: (generalized) random systems with complete connections.
The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.
A maximum principle approach to risk indifference pricing with partial information.
A minmax problem for parabolic systems with competitive interactions.
A mixed duel under arbitrary motion and uncertain existence of the shot
The purpose of the paper is to solve a mixed duel in which the numbers of shots given to the players are independent 0-1-valued random variables. The players know their distributions as well as the accuracy function P, the same for both players. It is assumed that the players can move as they like and that the maximal speed of the first player is greater than that of the second player. It is shown that the game has a value, and a pair of optimal strategies is found.
A mixed duel under arbitrary moving
A mixed game of timing: investigation of strategies
A mixed game of timing: problem of optimality
A morphic approach to combinatorial games : the Tribonacci case
We propose a variation of Wythoff’s game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.