Results 201 to 210 of about 2,154,790 (237)

Existence of a pure-strategy Bayesian Nash equilibrium in imperfectly discriminating contests [PDF]

open access: yes, 2010
We consider a general class of imperfectly discriminating contests with privately informed players. We show that findings by Athey (2001) imply the existence of a Bayesian Nash equilibrium in monotone pure strategies.
Wasser, Cédric
openaire   +4 more sources

On Basis and Pure Nash Equilibrium of Finite Pure Harmonic Games

Journal of Systems Science and Complexity, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aixin Liu   +3 more
openaire   +1 more source

An Introduction to the Complexity Class of Pure Nash Equilibrium

Anais do VIII Encontro de Teoria da Computação (ETC 2023), 2023
Taxonomy of problems in Computer Science has been typically done with formulations as decision problems. This approach is inadequate for many search problems of interest when the structure of the instance in itself guarantees the existence of a positive certificate.
Victor Hugo Wirz, Pedro Nuno Moura
openaire   +1 more source

On the Existence and Uniqueness of Pure Nash Equilibrium in Rent-Seeking Games

Games and Economic Behavior, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Szidarovszky, Ferenc, Okuguchi, Koji
openaire   +2 more sources

Pure Nash Equilibrium and Strong Nash Equilibrium Computation in Additive Aggregate Games

International Joint Conference on Autonomous Agents and Multiagent Systems
Aggregate games, first conceptualized by Nobel laureate Reinhard Selten in 1970, model the decision-making of interdependent agents where each agent's utility depends on their own action and the aggregation of everyone's actions. We consider computational questions on pure Nash equilibrium (PNE) and pure strong Nash equilibrium (SNE) for aggregate ...
Jared Soundy   +2 more
openaire   +2 more sources

Pure strategy Nash Equilibrium in 2-contestant generalized lottery Colonel Blotto games

Journal of Mathematical Economics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xinmi Li, Jie Zheng
openaire   +1 more source

On the existence of pure-strategy Nash equilibrium

Economics Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games

Proceedings of the 11th ACM conference on Electronic commerce, 2010
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLS-complete. In general potential games, even the problem of computing any finite approximation to a pure equilibrium is also PLS-complete.
Anand Bhalgat   +2 more
openaire   +2 more sources

Existence of Risk Strategy Equilibrium in Games Having No Pure Strategy Nash Equilibrium

2009
Two key properties defining an intelligent agent are reactive and pro-active. Before designing an intelligent agent for any multi-agent system, we need to first understand how agents should behave and interact in that particular application, which can be done by modelling the application as a game . To analyze these games and to understand how decision-
Ka-man Lam, Ho-fung Leung
openaire   +1 more source

Pure Strategy Nash Equilibrium in a Group Formation Game with Positive Externalities

Games and Economic Behavior, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konishi, Hideo   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy