• Corpus ID: 245650842

Coherence of probabilistic constraints on Nash equilibria

@article{Preto2022CoherenceOP,
  title={Coherence of probabilistic constraints on Nash equilibria},
  author={Sandro Preto and Eduardo Ferm'e and Marcelo Finger},
  journal={ArXiv},
  year={2022},
  volume={abs/2201.00746}
}
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he assigns subjective probabilities to players’ actions. However, not all probabilistic assignments are coherent with a given game. We study the decision problem of determining if a given set of probabilistic constraints assigned a priori by the observer to a given… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 27 REFERENCES

The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria

Pure Nash equilibria: hard and easy games

It is shown that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether agame has a strong Nash equilibrium is ΣP2-complete, and practically relevant restrictions that lower the complexity are studied.

New complexity results about Nash equilibria

Algorithmic Game Theory: The Complexity of Finding Nash Equilibria

The recent proof that finding a Nash equilibrium is complete for the complexity class PPAD, even in the case of two players, is outlined, evidence that the problem is intractable.

Non-cooperative games

Non-cooperative game models are described and game theoretic solution concepts are discussed, as well as refinements and relaxations of rationalizability and correlated equilibria.

On the Complexity of Nash Equilibria and Other Fixed Points

It is shown that the (exact or approximate) computation of Nash equilibria for 3 or more players is complete for FIXP, which captures search problems that can be cast as fixed point computation problems for functions represented by algebraic circuits (straight line programs) over basis with rational constants.

The complexity of computing a Nash equilibrium

This proof uses ideas from the recently-established equivalence between polynomial time solvability of normal form games and graphical games, establishing that these kinds of games can simulate a PPAD-complete class of Brouwer functions.

Equilibrium Points in N-Person Games.

  • J. Nash
  • Economics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1950
One may define a concept of an n -person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n -tuple of pure

Probabilistic satisfiability: algorithms with the presence and absence of a phase transition

It is shown that variations of these algorithms may lead to the partial occlusion of the phase transition phenomenon and the reasons for this change ofc practical behavior are discussed.

Probabilistic Satisfiability

There is no guarantee that the algorithm will find a satisfying assignment if one exists (i.e., incompleteness), but such algorithms are advantageous for certain classes of problems.