Similar Search Results

Existence, uniqueness, and algorithm for identifying free riders in multiple public good games : replacement function approach

Suzuki, Ken-ichi; Itaya, Jun-ichi; Yamanashi, Akitomo; … - 2018

using graph theory. This sufficient condition allows us to use the replacement function approach of Cornes and Hartley (2007 …) not only to develop an algorithm for identifying free riders, but also to provide an alternative proof for the uniqueness …

Persistent link: https://www.econbiz.de/10011853293

Technical note: characterizing and computing the set of nash equilibria via vector optimization

Feinstein, Zachary; Rudloff, Birgit - In: Operations research 72 (2024) 5, pp. 2082-2096

Persistent link: https://www.econbiz.de/10015361768

An elliptic algorithm for Nash-equilibria

Moltzahn, Siegmar - 1995

Persistent link: https://www.econbiz.de/10000549951

Strategic Games and Algorithmic Secrecy

Cofone, Ignacio; Strandburg, Katherine J. - 2020

We challenge a claim commonly made by industry and government representatives and echoed by legal scholarship: that algorithmic decision-making processes are better kept opaque or secret because otherwise decision-subjects will “game the system”, leading to inaccurate or unfair results. We...

Persistent link: https://www.econbiz.de/10014104614

Algorithms May Not Learn to Play a Unique Nash Equilibrium

Fujiwara-Greve, Takako; Nielsen, Carsten - 2021

There is a widespread hope that, in the near future, algorithms become so sophisticated that ``solutions" to most problems are found by machines. In this note, we throw some doubts on this expectation by showing the following impossibility result: given a set of finite-memory, finite-iteration...

Persistent link: https://www.econbiz.de/10013241420

Chapter 45 Computing equilibria for two-person games

Von Stengel, Bernhard - In: Handbook of game theory with economic applications : …, (pp. 1723-1759). 2002

given in strategic form or extensive form. The classical Lemke-Howson algorithm finds one equilibrium of a bimatrix game … that show the subdivision of the players' mixed strategy sets into best-response regions. The Lemke-Howson algorithm is … of the algorithm based on lexicographic perturbations. Commonly used definitions of degenerate games are shown as …

Persistent link: https://www.econbiz.de/10014024500

Chapter 14. The Complexity of Computing Equilibria

Papadimitriou, Christos - In: Handbook of game theory with economic applications : …, (pp. 779-810). 2015

develops the necessary background and formalism from the theory of algorithms and complexity developed in computer science, in …

Persistent link: https://www.econbiz.de/10014025445

Deep Q-learning for Nash equilibria : Nash-DQN

Casgrain, Philippe; Ning, Brian; Jaimungal, Sebastian - In: Applied mathematical finance 29 (2022) 1, pp. 62-78

Persistent link: https://www.econbiz.de/10013554784

Homotopy Methods to Compute Equilibria in Game Theory

Herings, P. Jean-Jacques - 2011

This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust … expositions of the Lemke-Howson algorithm and the Van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and …

Persistent link: https://www.econbiz.de/10013124577

Monte Carlo fictitious play for finding pure Nash equilibria in identical interest games

Kiatsupaibul, Seksan; Pedrielli, Giulia; Ryan, … - In: INFORMS journal on optimization 6 (2024) 3/4, pp. 155-172

Persistent link: https://www.econbiz.de/10015191170