Computing Generalized Nash Equilibria by Polynomial Programming
نویسندگان
چکیده
منابع مشابه
Nash Equilibria via Polynomial Equations
We consider the problem of computing a Nash equilibrium in multiple-player games. It is known that there exist games, in which all the equilibria have irrational entries in their probability distributions [19]. This suggests that either we should look for symbolic representations of equilibria or we should focus on computing approximate equilibria. We show that every finite game has an equilibr...
متن کاملComputing Nash Equilibria in Generalized Interdependent Security Games
We study the computational complexity of computing Nash equilibria in generalized interdependent-security (IDS) games. Like traditional IDS games, originally introduced by economists and risk-assessment experts Heal and Kunreuther about a decade ago, generalized IDS games model agents’ voluntary investment decisions when facing potential direct risk and transfer-risk exposure from other agents....
متن کاملComputing Nash Equilibria by Iterated Polymatrix Approximation
This article develops a new algorithm for computing a Nash equilibrium of an N-person game. The algorithm approximates the game by a sequence of polymatrix games. We provide su±cient conditions for local convergence to an equilibrium and report on our computational experience. The algorithm convergences rapidly but it is not failsafe. We show that if the algorithm does not converge then one can...
متن کاملComputing Nash Equilibria in Generalized Interdependent Security Games: Supplementary Material
In the following, we assume, without loss of generality, that for all players i, Ri > 0, δi > 0, pi > 0, and αi > 0. Given a joint mixed-strategy x, we partition the players by type w.r.t. x: let I ≡ I(x) ≡ {i | xi = 1}, N ≡ N(x) ≡ {i | xi = 0}, and P ≡ P (x) ≡ {i | 0 < xi < 1} be the set of players that fully invest in protection, do not invest in protection, and partially invest in protection...
متن کاملGeneralized Nash equilibria for SaaS/PaaS Clouds
Cloud computing is an emerging technology that allows to access computing resources on a pay-per-use basis. The main challenges in this area are the efficient performance management and the energy costs minimization. In this paper we model the service provisioning problem of Cloud Platform-as-aService systems as a Generalized Nash Equilibrium Problem and show that a potential function for the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2048414