A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems
Copyright policy )A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Karlsruhe Institute of Technology Germany
- Wageningen University & Research Netherlands
\(\varepsilon\)-Nash equilibrium problem, nonconvex, info:eu-repo/classification/ddc/330, 330, ddc:330, Economics, Nash equilibrium problems, spatial branch-and-bound, complete solution set, varepsilon-Nash equilibrium problem, Algorithmic game theory and complexity, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), Nonconvex programming, global optimization
\(\varepsilon\)-Nash equilibrium problem, nonconvex, info:eu-repo/classification/ddc/330, 330, ddc:330, Economics, Nash equilibrium problems, spatial branch-and-bound, complete solution set, varepsilon-Nash equilibrium problem, Algorithmic game theory and complexity, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), Nonconvex programming, global optimization
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!