English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Rationalizability is a widely accepted solution concept in the study of strategic-form games with complete information and is fully characterized in terms of assumptions on the rationality of the players and common certainty of rationality.Battigalli and Siniscalchi extend rationalizability taking as given some exogenous restrictions on players' beliefs and derive the solution concept called ?-rationalizability. This new solution concept has been applied to games with incomplete information as well as dynamic games.On this note, I focus on games with incomplete information and characterize ?-rationalizability with a new notion of iterative dominance that is able to capture the additional hypothesis on players' beliefs.

A Note on Rationalizability and Restrictions on Beliefs