Abstract
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present all relevant techniques underlying homotopy algorithms. We give detailed expositions of the Lemke-Howson algorithm and the Van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and the Herings-Van den Elzen, Herings-Peeters, and McKelvey-Palfrey algorithms to compute Nash equilibria in general n-person games.
Cite
CITATION STYLE
R, T. (2015). Metal Oxide Nano-particles as an Adsorbent for Removal of Heavy Metals. Journal of Advanced Chemical Engineering, 5(3). https://doi.org/10.4172/2090-4568.1000125
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.