Results 11 to 20 of about 2,371 (115)
Supermodularity and preferences [PDF]
, 2008 We uncover the complete ordinal implications of supermodularity on finite lattices under the assumption of weak monotonicity. In this environment, we show that supermodularity is ordinally equivalent to the notion of quasisupermodularity introduced by ...
Chambers, Christopher P. +1 more
core +4 more sources
Uniqueness Conditions for Point-Rationalizable [PDF]
The unique point-rationalizable solution of a game is the unique Nash equilibrium. However, this solution has the additional advantage that it can be justified by the epistemic assumption that it is Common Knowledge of the players that only best ...
Zimper, Alexander
core
Refinements of rationalizability for normal-form games. [PDF]
In normal-form games, rationalizability (Bernheim [3], Pearce [11]) on its own fails to exclude some very implausible strategy choices. Three main refinements of rationalizability have been proposed in the literature: cautious, perfect, and proper ...
Herings, P. Jean-Jacques +1 more
core +4 more sources
Epistemically stable strategy sets [PDF]
This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.Epistemic game theory; epistemic
Geir B. Asheim +2 more
core
Epistemically stable strategy sets [PDF]
, 2009 This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb ...
Asheim, Geir B. +2 more
core +3 more sources
The number of boundedly rational choices on four elements. [PDF]
MethodsX, 2022 Giarlotta A, Petralia A, Watson S.
europepmc +1 more source
Prudent Rationalizability in Generalized Extensive-Form Games [PDF]
We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system ...
Aviad Heifetz +2 more
core
Pareto-Optimal Matching Allocation Mechanisms for Boundedly Rational Agents [PDF]
This article is concerned with the welfare properties of trade when the behavior of agents cannot be rationalized by preferences. I investigate this question in an environment of matching allocation problems.
Sophie Bade
core
Revealed desirability: a novel instrument for social welfare. [PDF]
Theory Decis, 2022 Barokas G.
europepmc +1 more source
Rationalizable Implementation [PDF]
We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict (and thus stronger) version of the monotonicity condition introduced by Maskin (1999) is necessary under the solution concept of ...
Dirk Bergemann +2 more
core +3 more sources