Superrational types
We present a formal analysis of Douglas Hofstadter's concept of \emph{superrationality}. We start by defining superrationally justifiable actions, and study them in symmetric games. We then model the beliefs of the players, in a way that leads them to different choices than the usual assumption of rationality by restricting the range of conceivable choices. These beliefs are captured in the formal notion of \emph{type} drawn from epistemic game theory. The theory of coalgebras is used to frame type spaces and to account for the existence of some of them. We find conditions that guarantee superrational outcomes.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
ManyTypes4TypeScript: A Comprehensive TypeScript Dataset for Sequence-Based Type Inference
In this paper, we present ManyTypes4TypeScript, a very large corpus for training and evaluating machine-learning models for sequence-based type inference in TypeScript. The dataset includes over 9 million type annotat…
Type predictionYelp Reviews and Food Types: A Comparative Analysis of Ratings, Sentiments, and Topics
This study examines the relationship between Yelp reviews and food types, investigating how ratings, sentiments, and topics vary across different types of food. Specifically, we analyze how ratings and sentiments of revi…
Lifelong Event Detection with Knowledge Transfer
Traditional supervised Information Extraction (IE) methods can extract structured knowledge elements from unstructured data, but it is limited to a pre-defined target ontology. In reality, the ontology of interest may ch…
Event DetectionLifelong learningTransfer LearningExplaining Radiological Emphysema Subtypes with Unsupervised Texture Prototypes: MESA COPD Study
Pulmonary emphysema is traditionally subcategorized into three subtypes, which have distinct radiological appearances on computed tomography (CT) and can help with the diagnosis of chronic obstructive pulmonary disease (…
Computed Tomography (CT)DroidStar: Callback Typestates for Android Classes
Event-driven programming frameworks, such as Android, are based on components with asynchronous interfaces. The protocols for interacting with these components can often be described by finite-state machines we dub *call…
Active Learning