Acceso al sitio web del Consejo de Políticas de Infraestructura
REVISTA
Algorithms

   
Inicio  /  Algorithms  /  Vol: 14 Par: 12 (2021)  /  Artículo
ARTÍCULO
TITULO

A Branch-and-Bound Algorithm for Polymatrix Games ?-Proper Nash Equilibria Computation

Slim Belhaiza    

Resumen

When several Nash equilibria exist in the game, decision-makers need to refine their choices based on some refinement concepts. To this aim, the notion of a ?? ? -proper equilibria set for polymatrix games is used to develop 0?1 mixed linear programs and compute ?? ? -proper Nash equilibria. A Branch-and-Bound exact arithmetics algorithm is proposed. Experimental results are provided on polymatrix games randomly generated with different sizes and densities.

PÁGINAS
pp. 0 - 0

 Artículos similares

       
 
Elias Munapo     Pág. 59 - 69
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer... ver más

 
Mikhail Abramyan,Boris Melnikov     Pág. 1 - 7
We consider the problem of state minimization of nondeterministic finite automata. One of the ways to solve it is to analyze a subset of the set of states of two canonical automa-ta constructed on the basis of the initial nondeterministic finite automato... ver más

 
Juan Fang, Yong Chen and Shuaibing Lu    
Edge computing is an emerging paradigm that settles some servers on the near-user side and allows some real-time requests from users to be directly returned to the user after being processed by these servers settled on the near-user side. In this paper, ... ver más
Revista: Applied Sciences

 
Mikhail Abramyan,Boris Melnikov     Pág. 1 - 9
We continue to study heuristics that can be applied to solve the problem of minimizing the states of nondeterministic finite automata by the branch and bound method, or rather, to the implementation of the most difficult stage of the solution associated ... ver más

 
Elias Munapo     Pág. 6 - 10
The paper presents a new method for solving the 0?1 linear programming problems (LPs). The general 0?1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes an... ver más