Results 171 to 180 of about 2,111 (192)

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

, 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.
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.

2009
We prove $\mathcal{NP}$-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desired property and then embed it to a larger game which encodes a $\mathcal{NP}$-hard problem in order to prove the complexity of the desired property in a game. This
openaire   +2 more sources

Pure Nash equilibriums and independent dominating sets in evolutionary games on networks

Journal of Dynamics and Games
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mocenni, Chiara, Moraes, Jean Carlo
openaire   +2 more sources

Pure Strategy Nash Equilibrium and Simultaneous-Move Games with Complete Information

2016
This chapter analyzes behavior in relatively simple strategic settings: simultaneous-move games of complete information. Let us define the two building blocks of this chapter: best responses and Nash equilibrium.
Felix Munoz-Garcia, Daniel Toro-Gonzalez
openaire   +1 more source

Existence and Uniqueness of Pure Nash Equilibrium in Asymmetric Contests with Endogenous Prizes [PDF]

Economics Bulletin, 2012
This paper considers a contest with an endogenous prize, which is increasing in aggregate efforts of the players. Each player may have a different valuation of the prize and a different ability to convert expenditures to productive efforts. Under standard assumptions in the literature, we prove that there exists a unique pure Nash equilibrium in ...
openaire  

Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach

2007
Considerable progress has been made in recent years in complexity analysis of Nash equilibrium, so we restrict our attention to seek it from the empirical perspective in this paper. Based on a new description format of game - stimulate - response pair proposed in the paper, we put forward a constraints satisfaction-based algorithm on this data ...
openaire   +1 more source

The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality

Discrete Applied Mathematics, 2022
Tesshu Hanaka, Hirotaka Ono
exaly  

Strict pure strategy Nash equilibrium in large finite-player games when the action set is a manifold

Journal of Mathematical Economics, 2022
Guilherme Carmona, Konrad Podczeck
exaly  

Symmetries and the complexity of pure Nash equilibrium

Journal of Computer and System Sciences, 2009
Felix Brandt, Felix Fischer, Markus Holzer   +2 more
exaly  

On the Existence of Pure Nash Equilibrium in Dynamic Traffic Assignments

Traffic assignment is a set of criteria through which the demand for mobility is distributed over the links of a transport network. Over the last 30 years, Dynamic Traffic Assignment (DTA) models have been developed to support time-dependent analyses in nascent fields that need to take into account the temporal distribution of demand and supply.
openaire   +1 more source