Lexicographic rationalizability and iterated admissibility
type: Item
instance of: scholarly article
title: Lexicographic rationalizability and iterated admissibility
zbMATH Open document ID: 0900.90422
DOI: 10.1016/0165-1765(94)00530-F
published in: Economics Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 91A99
zbMATH DE Number: 985924
zbMATH Keywords: lexicographic probability systems
zbMATH Keywords: lexicographic rationalizability
zbMATH Keywords: iterated admissibility
author: Dale O. Stahl
MaRDI profile type: Publication
cites work: Rationalizable Strategic Behavior
cites work: Lexicographic Probabilities and Choice Under Uncertainty
cites work: Lexicographic Probabilities and Equilibrium Refinements
cites work: Rational behavior with payoff uncertainty
cites work: On the order of eliminating dominated strategies
cites work: Rationalizable Strategic Behavior and the Problem of Perfection
cites work: Dominated strategies and common knowledge
cites work: The Bayesian foundations of solution concepts of games
Recommended article: Directed lexicographic rationalizability
Recommended article: Proper rationalizability in lexicographic beliefs
Recommended article: The complexity of admissible rules of Lukasiewicz logic
Recommended article: Admissible rules and the Leibniz hierarchy
Recommended article: Admissibility in positive logics
Recommended article: Decidability of the admissibility problem in layer-finite logics
Recommended article: Admissible and derivable rules in intuitionistic logic
Recommended article: On the admissible rules of intuitionistic propositional logic
Recommended article: Iteration of rational transductions
Recommended article: Admissibility, compatibility, and deducibility in first-order sequent logics
description: scientific article; zbMATH DE number 985924