Nonconvex Nash Games : Solution Concepts and Algorithms
Game theory is a mathematical approach to model competition between several parties, called players. The goal of each player is to choose a strategy, which solves his optimization problem, i.e. minimizes or maximizes his objective function. Due to the competitive setting, this strategy may influence...
Similar Items
-
An equitable Nash solution to nonconvex bargaining problems
by: Xu, Y., et al.
Published: (2019) -
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
by: Christos Papadimitriou, et al.
Published: (2018-10-01) -
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
by: Boris Hancu, et al.
Published: (2018-05-01) -
A Nonsmooth Nonconvex Descent Algorithm
by: Mankau, Jan Peter
Published: (2017) -
On the Solution of a Nonconvex Fractional Quadratic Problem
by: S. Ketabchi, et al.
Published: (2015-06-01)