Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces (Q361813): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
The author provides an epistemic characterization of an iterative deletion procedure proposed by \textit{R. Stalnaker} [Theory Decis. 37, No. 1, 49--73 (1994; Zbl 0805.90150)] that yields a solution concept for strategic-form games called ``strong rationalizability''. The iterative deletion procedure is called ``iterated deletion of inferior strategy profiles''. An epistemic characterization of the pure-strategy version of that solution concept was proposed by the reviewer [in: Logic and the foundations of game and decision theory (LOFT7). Revised papers presented at the 7th conference, Liverpool, UK, July 2006. Amsterdam: Amsterdam University Press. 59--86 (2008; Zbl 1279.91034)] in the context of qualitative Kripke frames. This paper, on the other hand, follows the event-based approach and considers type space models where each type is associated with a preference relation on the state space. Within this context the author provides an epistemic characterization of both the qualitative, pure-strategy version and the probabilistic version of the iterative deletion algorithm. | |||
Property / review text: The author provides an epistemic characterization of an iterative deletion procedure proposed by \textit{R. Stalnaker} [Theory Decis. 37, No. 1, 49--73 (1994; Zbl 0805.90150)] that yields a solution concept for strategic-form games called ``strong rationalizability''. The iterative deletion procedure is called ``iterated deletion of inferior strategy profiles''. An epistemic characterization of the pure-strategy version of that solution concept was proposed by the reviewer [in: Logic and the foundations of game and decision theory (LOFT7). Revised papers presented at the 7th conference, Liverpool, UK, July 2006. Amsterdam: Amsterdam University Press. 59--86 (2008; Zbl 1279.91034)] in the context of qualitative Kripke frames. This paper, on the other hand, follows the event-based approach and considers type space models where each type is associated with a preference relation on the state space. Within this context the author provides an epistemic characterization of both the qualitative, pure-strategy version and the probabilistic version of the iterative deletion algorithm. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Giacomo Bonanno / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A26 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6199387 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rationalizability | |||
Property / zbMATH Keywords: rationalizability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
strong rationalizability | |||
Property / zbMATH Keywords: strong rationalizability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
iterated deletion of strategy profiles | |||
Property / zbMATH Keywords: iterated deletion of strategy profiles / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
epistemic game theory | |||
Property / zbMATH Keywords: epistemic game theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
preference-based type space | |||
Property / zbMATH Keywords: preference-based type space / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00182-011-0315-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1970271349 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rationalizable Strategic Behavior and the Problem of Perfection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Agreeing to disagree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Correlated Equilibrium as an Expression of Bayesian Rationality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Epistemic Conditions for Nash Equilibrium / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rationalizable Strategic Behavior / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4648828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Stalnaker's notion of strong rationalizability and Nash equilibrium in perfect information games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Assessing the truth axiom under incomplete information / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pure Strategy Dominance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: "Beliefs about Beliefs" without Probabilities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4845472 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The logic of belief and belief change: a decision theoretic approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5826088 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the evaluation of solution concepts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Bayesian foundations of solution concepts of games / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:13, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces |
scientific article |
Statements
Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces (English)
0 references
19 August 2013
0 references
The author provides an epistemic characterization of an iterative deletion procedure proposed by \textit{R. Stalnaker} [Theory Decis. 37, No. 1, 49--73 (1994; Zbl 0805.90150)] that yields a solution concept for strategic-form games called ``strong rationalizability''. The iterative deletion procedure is called ``iterated deletion of inferior strategy profiles''. An epistemic characterization of the pure-strategy version of that solution concept was proposed by the reviewer [in: Logic and the foundations of game and decision theory (LOFT7). Revised papers presented at the 7th conference, Liverpool, UK, July 2006. Amsterdam: Amsterdam University Press. 59--86 (2008; Zbl 1279.91034)] in the context of qualitative Kripke frames. This paper, on the other hand, follows the event-based approach and considers type space models where each type is associated with a preference relation on the state space. Within this context the author provides an epistemic characterization of both the qualitative, pure-strategy version and the probabilistic version of the iterative deletion algorithm.
0 references
rationalizability
0 references
strong rationalizability
0 references
iterated deletion of strategy profiles
0 references
epistemic game theory
0 references
preference-based type space
0 references
0 references
0 references