RO EN
Nash equilibria set computing in finite extended games
Authors: Valeriu Ungureanu
Keywords: Noncooperative game, normal form game, Nash equilibrium (NE), Nash equilibria set (NES), graph of best response mapping, intersection, method, algorithm, computational complexity.
Mathematics Subject Classification 2000:91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90.
– 0.20 Mb
Keywords: Noncooperative game, normal form game, Nash equilibrium (NE), Nash equilibria set (NES), graph of best response mapping, intersection, method, algorithm, computational complexity.
Abstract
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied.Mathematics Subject Classification 2000:91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90.
V. Ungureanu
State University of Moldova,
60, A. Mateevici str.,
Chisinau, MD-2009, Moldova.
E-mail :
State University of Moldova,
60, A. Mateevici str.,
Chisinau, MD-2009, Moldova.
E-mail :
Fulltext
– 0.20 Mb
Contents
- Generating Languages by P Systems with Minimal Symport/Antiport
- Applying Evolution Strategies for Chest Radiographs Segmentation
- Nash equilibria set computing in finite extended games
- Graph Coloring using Peer-to-Peer Networks
- The graphic representations for the one-dimensional solutions of problem from elastic mechanic deformations of two-component mixture
- An Approach to Shorten Digital Signature Length
- Cryptoschemes Based on New Signature Formation Mechanism
