Coherence of probabilistic constraints on Nash equilibria

  title={Coherence of probabilistic constraints on Nash equilibria},
  author={Sandro Preto and Eduardo Ferm'e and Marcelo Finger},
  journal={J. Braz. Comput. Soc.},
In this work, we first deal with the modeling of game situations that reach one of possibly many Nash equilibria. Before an instance of such a game starts, an external observer does not know, a priori, what is the exact profile of actions -- constituting an equilibrium -- that will occur; thus, he assigns subjective probabilities to players' actions. Such scenario is formalized as an observable game, which is a newly introduced structure for that purpose. Then, we study the decision problem of… 

Figures and Tables from this paper



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.

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.

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.

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a

Helly, Radon, and Carathéodory Type Theorems

Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition

A PSAT normal form is defined, based on which two logic-based algorithms are proposed: a reduction of normal form PSAT instances to SAT, and a linearalgebraic algorithm with a logic- based column generation strategy that presents a phase transition behaviour.