Distributed algorithms for the computation of noncooperative equilibria
Automatica (Journal of IFAC)
Computation of Nash equilibria: admissibility of parallel gradient descent
Journal of Optimization Theory and Applications
Approximating the maximum weight clique using replicator dynamics
IEEE Transactions on Neural Networks
Mathematics and Computers in Simulation
A game theory-based model for product portfolio management in a competitive market
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The present analysis applies continuous time replicator dynamics to the analysis of oligopoly markets. In the present paper, we discuss continuous game problems in which decision-making variables for each player are bounded on a simplex by equalities and non-negative constraints. Several types of problems are considered under conditions of normalized constraints and non-negative constraints. These problems can be classified into two types based on their constraints. For one type, the simplex constraint applies to the variables for each player independently, such as in a product allocation problem. For the other type, the simplex constraint applies to interference among all players, creating a market share problem. In the present paper, we consider a game problem under the constraints of allocation of product and market share simultaneously. We assume that a Nash equilibrium solution can be applied and derive the gradient system dynamics that attain the Nash equilibrium solution without violating the simplex constraints. Models assume that three or more firms exist in a market. Firms behave to maximize their profits, as defined by the difference between their sales and cost functions with conjectural variations. The effectiveness of the derived dynamics is demonstrated using simple data. The present approach facilitates understanding the process of attaining equilibrium in an oligopoly market.