Rationalizable conjectural equilibrium: Between Nash and rationalizability
From MaRDI portal
Publication:1319966
DOI10.1006/game.1994.1016zbMath0790.90085OpenAlexW2064144504MaRDI QIDQ1319966
Ariel Rubinstein, Asher Wolinsky
Publication date: 21 April 1994
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/933.pdf
Related Items (30)
On the Complexity of Equilibrium Computation in First-Price Auctions ⋮ Learning in extensive-form games. I: Self-confirming equilibria ⋮ Subjective games and equilibria ⋮ An epistemic characterization of MACA ⋮ Belief distorted Nash equilibria: introduction of a new kind of equilibrium in dynamic games with distorted information ⋮ Redefinition of belief distorted Nash equilibria for the environment of dynamic games with probabilistic beliefs ⋮ On the dynamic selection of mechanisms for provision of public projects ⋮ Equilibria of nonatomic anonymous games ⋮ Observability, dominance, and induction in learning models ⋮ Outcome-equivalence of self-confirming equilibrium and Nash equilibrium ⋮ Unnamed Item ⋮ Learning to play Bayesian games. ⋮ Payoff information and self-confirming equilibrium ⋮ Shadow links ⋮ Position-specific information in social networks: Are you connected? ⋮ Correlated-belief equilibrium ⋮ Rationalizable partition-confirmed equilibrium with heterogeneous beliefs ⋮ On pure conjectural equilibrium with non-manipulable information ⋮ Imperfect monitoring in communication networks ⋮ Stable equilibrium in beliefs in extensive games with perfect information ⋮ Equilibrium with computationally constrained agents ⋮ Player-compatible learning and player-compatible equilibrium ⋮ A review of transport market modeling using game-theoretic principles ⋮ Mutually acceptable courses of action ⋮ The algebraic geometry of perfect and sequential equilibrium: an extension ⋮ Discovery and equilibrium in games with unawareness ⋮ Categorizing others in a large game ⋮ Social learning in nonatomic routing games ⋮ Optimal substructure of set-valued solutions of normal-form games and coordination ⋮ On non-Nash equilibria
This page was built for publication: Rationalizable conjectural equilibrium: Between Nash and rationalizability
