Maximal-Element Rationalizability∗

نویسندگان

  • Walter Bossert
  • Yves Sprumont
  • Kotaro Suzumura
چکیده

We examine the maximal-element rationalizability of choice functions with arbitrary domains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier literature, this is not the case for maximal-element rationalizability, except when it coincides with greatest-element rationalizability because of properties imposed on the rationalizing relation. We develop necessary and sufficient conditions for maximal-element rationalizability by itself, and for maximal-element rationalizability in conjunction with additional properties of a rationalizing relation such as reflexivity, completeness, P -acyclicity, quasitransitivity, consistency and transitivity. Journal of Economic Literature Classification No.: D11.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rationalizability of choice functions on general domains without full transitivity

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of t...

متن کامل

Refinements of rationalizability for normal-form games

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 rationalizability. Nevertheless, some of these refinements also fail to eliminate unreasonable outcomes and suffer from several drawbacks. Therefore,...

متن کامل

Re®nements of rationalizability for normal-form games*

There exist three equivalent de®nitions of perfect Nash equilibria which di ̈er in the way ``best responses against small perturbations'' are de®ned. It is shown that applying the spirit of these de®nitions to rationalizability leads to three di ̈erent re®nements of rationalizable strategies which are termed perfect (Bernheim, 1984), weakly perfect and trembling-hand perfect rationalizability, re...

متن کامل

Rationalizability under Uncertainty using Imprecise Probabilities ̊

The notion of imprecise probability can be viewed as a generalization of the traditional notion of probability. Several theories and models of imprecise probability have been suggested in the literature as more appropriate representations of uncertainty in the context of single-agent decision making. In this paper I investigate the question of how such models can be incorporated into the tradit...

متن کامل

14.126 Lecture 9: Rationalizability and correlated equilibrium

When we define a game we implicitly assume that the structure (i.e. the set of players, their strategy sets and the fact that they try to maximize the expected value of the von-Neumann and Morgenstern utility functions) described by the game is common knowledge. The exact implications of this implicit assumption is captured by rationalizability. In this lecture, I will formally demonstrate this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002