Results 31 to 40 of about 7,890,208 (208)
On the exact polynomial time algorithm for a special class of bimatrix game
Lietuvos Matematikos Rinkinys, 2013 The Strategy Elimination (SE) algorithm was proposed in [2] and implemented by a sequence of Linear Programming (LP) problems. In this paper an efficient explicit solution is developed and the convergence to the Nash Equilibrium is proven. Keywords: game
Jonas Mockus, Martynas Sabaliauskas
doaj +1 more source
A Game-Theoretic Approach of Optimized Operation of AC/DC Hybrid Microgrid Clusters
Energies, 2022 To maximize the benefits of microgrid clusters, a general model and analysis method for studying the optimized operation of AC/DC microgrid clusters using non-cooperative games is proposed. This paper first establishes the optimized objective function of
Xuewei Pan +5 more
doaj +1 more source
MathematicsIn this study, we proposed proximal analytic center cutting plane algorithms for solving variational inequalities whose domains are normal regions. Our algorithms stop with a solution of the variational inequality after a finite number of iterations, or ...
Renying Zeng
doaj +1 more source
The method of feasible directions in problems nonlinear programming for bimatrix games [PDF]
Компьютерные исследования и моделирование, 2012 The problem of the Nash equilibrium in bimatrix game is considered. The search for a solution is associated with a problem of nonlinear programming. Application of the method of feasible directions for the solution of such a problem is investigated.
Dariya Sergeevna Nabatova
doaj +1 more source
An improved predator-prey particle swarm optimization algorithm for Nash equilibrium solution.
PLoS ONE, 2021 Focusing on the problem incurred during particle swarm optimization (PSO) that tends to fall into local optimization when solving Nash equilibrium solutions of games, as well as the problem of slow convergence when solving higher order game pay off ...
Yufeng Meng +4 more
doaj +1 more source
A characterization of the Nash bargaining solution [PDF]
Social Choice and Welfare, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dagan, N., Volij, O., Winter, E.
openaire +3 more sources
The Nash bargaining solution is optimal [PDF]
Journal of Economic Theory, 1986 The author studies the classical two-person bargaining game. The set F consists of all bargaining solutions that satisfy the following known axioms: Pareto optimality, scale invariance, symmetry and risk sensitivity. It is proved that for any bargaining game S the set \(\{\) f(S): \(f\in S\}\) is closed and connected. A meta bargaining game \(\Gamma\) (
openaire +4 more sources
Growth versus environment in dynamic models of capital accumulation
Discrete Dynamics in Nature and Society, 2002 In this paper, we study the economic implications of the trade off between growth and environment in the context of dynamic models of capital accumulation. The collective solution is formulated in terms of dynamic optimization of the central planner, and
Toichiro Asada
doaj +1 more source
Mathematics, 2021 In this paper, we examine a sampled-data Nash equilibrium strategy for a stochastic linear quadratic (LQ) differential game, in which admissible strategies are assumed to be constant on the interval between consecutive measurements.
Vasile Drăgan +3 more
doaj +1 more source
Core-equivalence for the Nash bargaining solution [PDF]
Economic Theory, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources