We study how asymmetric information affects the set of rationalizable solutions in a linear setup where the outcome is determined by forecasts about this same outcome. The unique rational expectations equilibrium is also the unique rationalizable solution when the sensitivity of the outcome to...

We study how asymmetric information affects the set of rationalizable solutions in a linear setup where the outcome is determined by forecasts about this same outcome. The unique rational expectations equilibrium is also the unique rationalizable solution when the sensitivity of the outcome to...

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...

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.

We study how asymmetric information affects market volatility in a linear setup where the outcome is determined by forecasts about this same outcome. The unique rational expectations equilibrium will be stable when it is the only rationalizable solution. It has been established in the literature...

We study how asymmetric information affects the set of rationalizable solutions in a linear setup where the outcome is determined by forecasts about this same outcome. The unique rational expectations equilibrium is also the unique rationalizable solution when the sensitivity of the outcome to...

We study rationalizable solutions in a linear asymmetric Cournot oligopoly. We show that symmetry across firms favors multiplicity of rationalizable solutions: A merger (implying a greater asymmetry across firms) makes out-of-equilibrium behavior less likely and should dampen &lquo;coordination&rquo;...

The recursive formula for the value of the zero-sum repeated games with incomplete information on both sides is known for a long time. As it is explained in the paper, the usual proof of this formula is in a sense non constructive : it just claims that the players are unable to guarantee a...

We consider situations in which individuals would like to choose an action which is close to that of others, as well as close to a state of nature, with the ideal proximity to the state varying across agents. Before this coordination game is played, a cheap-talk communication stage is offered to...

Automated negotiation process seems to be a powerful mechanism to resolve disputes arising from Internet-based transactions. Automated negotiation is an online blind-bidding process in which an automated algorithm evaluates bids from the parties and settles the case if the offers are within a...