The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00763-x
Abstract: We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that ${\mathcal{NP}}$-hardness… read more here.
Keywords: symmetric win; win lose; bimatrix games; nash equilibria ... See more keywords
Fixation Probabilities of Strategies for Bimatrix Games in Finite Populations
Sign Up to like & getrecommendations! Published in 2017 at "Dynamic Games and Applications"
DOI: 10.1007/s13235-015-0170-2
Abstract: Recent developments in stochastic evolutionary game theory in finite populations yield insights that complement the conventional deterministic evolutionary game theory in infinite populations. However, most studies of stochastic evolutionary game theory have investigated dynamics of… read more here.
Keywords: game; games finite; fixation; bimatrix games ... See more keywords
Cold play: Learning across bimatrix games
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Economic Behavior and Organization"
DOI: 10.1016/j.jebo.2021.02.027
Abstract: We study one-shot play in the set of all bimatrix games by a large population of agents. The agents never see the same game twice, but they can learn ‘across games’ by developing solution concepts… read more here.
Keywords: cold play; play; play learning; learning across ... See more keywords