发布求助
文献互助 智能选刊 最新文献

Theoretical Aspects of Rationality and Knowledge最新文献

筛选
英文 中文
Rationalizability and Epistemic Priority Orderings 理性化和认知优先顺序
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.8
Emiliano Catonini
{"title":"Rationalizability and Epistemic Priority Orderings","authors":"Emiliano Catonini","doi":"10.4204/EPTCS.251.8","DOIUrl":"https://doi.org/10.4204/EPTCS.251.8","url":null,"abstract":"At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own theories, through strategic reasoning. I develop and characterize epistemically a new solution concept, Selective Rationalizability, which accomplishes this task under the following assumption: when the observed behavior is not compatible with the beliefs in players' rationality and theories of all orders, players keep the orders of belief in rationality that are per se compatible with the observed behavior, and drop the incompatible beliefs in the theories. Thus, Selective Rationalizability captures Common Strong Belief in Rationality (Battigalli and Siniscalchi, 2002) and refines Extensive-Form Rationalizability (Pearce, 1984; BS, 2002), whereas Strong-$Delta$-Rationalizability (Battigalli, 2003; Battigalli and Siniscalchi, 2003) captures the opposite epistemic priority choice. Selective Rationalizability can be extended to encompass richer epistemic priority orderings among different theories of opponents' behavior. This allows to establish a surprising connection with strategic stability (Kohlberg and Mertens, 1986).","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Games With Tolerant Players 包容玩家的游戏
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.18
Arpita Ghosh, Joseph Y. Halpern
{"title":"Games With Tolerant Players","authors":"Arpita Ghosh, Joseph Y. Halpern","doi":"10.4204/EPTCS.251.18","DOIUrl":"https://doi.org/10.4204/EPTCS.251.18","url":null,"abstract":"A notion of pi-tolerant equilibrium is defined that takes into account that players have some tolerance regarding payoffs in a game. This solution concept generalizes Nash and refines epsilon-Nash equilibrium in a natural way. We show that pi-tolerant equilibrium can explain cooperation in social dilemmas such as Prisoner's Dilemma and the Public Good game. We then examine the structure of particularly cooperative pi-tolerant equilibria, where players are as cooperative as they can be, subject to their tolerances, in Prisoner's Dilemma. To the extent that cooperation is due to tolerance, these results provide guidance to a mechanism designer who has some control over the payoffs in a game, and suggest ways in which cooperation can be increased.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114635113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Group Recommendations: Axioms, Impossibilities, and Random Walks 小组建议:公理、不可能性和随机漫步
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.28
Omer Lev, Moshe Tennenholtz
{"title":"Group Recommendations: Axioms, Impossibilities, and Random Walks","authors":"Omer Lev, Moshe Tennenholtz","doi":"10.4204/EPTCS.251.28","DOIUrl":"https://doi.org/10.4204/EPTCS.251.28","url":null,"abstract":"We introduce an axiomatic approach to group recommendations, in line of previous work on the axiomatic treatment of trust-based recommendation systems, ranking systems, and other foundational work on the axiomatic approach to internet mechanisms in social choice settings. In group recommendations we wish to recommend to a group of agents, consisting of both opinionated and undecided members, a joint choice that would be acceptable to them. Such a system has many applications, such as choosing a movie or a restaurant to go to with a group of friends, recommending games for online game players, & other communal activities. \u0000Our method utilizes a given social graph to extract information on the undecided, relying on the agents influencing them. We first show that a set of fairly natural desired requirements (a.k.a axioms) leads to an impossibility, rendering mutual satisfaction of them unreachable. However, we also show a modified set of axioms that fully axiomatize a group variant of the random-walk recommendation system, expanding a previous result from the individual recommendation case.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115163196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Reconciling Bayesian Epistemology and Narration-based Approaches to Judiciary Fact-finding 调和贝叶斯认识论与司法事实认定的叙事方法
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.37
R. Urbaniak
{"title":"Reconciling Bayesian Epistemology and Narration-based Approaches to Judiciary Fact-finding","authors":"R. Urbaniak","doi":"10.4204/EPTCS.251.37","DOIUrl":"https://doi.org/10.4204/EPTCS.251.37","url":null,"abstract":"Legal probabilism (LP) claims the degrees of conviction in juridical fact-finding are to be modeled exactly the way degrees of beliefs are modeled in standard bayesian epistemology. Classical legal probabilism (CLP) adds that the conviction is justified if the credence in guilt given the evidence is above an appropriate guilt probability threshold. The views are challenged on various counts, especially by the proponents of the so-called narrative approach, on which the fact-finders' decision is the result of a dynamic interplay between competing narratives of what happened. I develop a way a bayesian epistemologist can make sense of the narrative approach. I do so by formulating a probabilistic framework for evaluating competing narrations in terms of formal explications of the informal evaluation criteria used in the narrative approach.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Conditional Belief, Knowledge and Probability 条件信念，知识和概率
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.14
J. Eijck, K. Li
{"title":"Conditional Belief, Knowledge and Probability","authors":"J. Eijck, K. Li","doi":"10.4204/EPTCS.251.14","DOIUrl":"https://doi.org/10.4204/EPTCS.251.14","url":null,"abstract":"A natural way to represent beliefs and the process of updating beliefs is presented by Bayesian probability theory, where belief of an agent a in P can be interpreted as a considering that P is more probable than not P. This paper attempts to get at the core logical notion underlying this. \u0000The paper presents a sound and complete neighbourhood logic for conditional belief and knowledge, and traces the connections with probabilistic logics of belief and knowledge. The key notion in this paper is that of an agent a believing P conditionally on having information Q, where it is assumed that Q is compatible with what a knows. \u0000Conditional neighbourhood logic can be viewed as a core system for reasoning about subjective plausibility that is not yet committed to an interpretation in terms of numerical probability. Indeed, every weighted Kripke model gives rise to a conditional neighbourhood model, but not vice versa. We show that our calculus for conditional neighbourhood logic is sound but not complete for weighted Kripke models. Next, we show how to extend the calculus to get completeness for the class of weighted Kripke models. \u0000Neighbourhood models for conditional belief are closed under model restriction (public announcement update), while earlier neighbourhood models for belief as `willingness to bet' were not. Therefore the logic we present improves on earlier neighbourhood logics for belief and knowledge. We present complete calculi for public announcement and for publicly revealing the truth value of propositions using reduction axioms. The reductions show that adding these announcement operators to the language does not increase expressive power.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133687702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
The Topology-Free Construction of the Universal Type Structure for Conditional Probability Systems 条件概率系统泛型结构的无拓扑构造
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.20
Pierfrancesco Guarino
{"title":"The Topology-Free Construction of the Universal Type Structure for Conditional Probability Systems","authors":"Pierfrancesco Guarino","doi":"10.4204/EPTCS.251.20","DOIUrl":"https://doi.org/10.4204/EPTCS.251.20","url":null,"abstract":"We construct the universal type structure for conditional probability systems without any topological assumption, namely a type structure that is terminal, belief-complete, and non-redundant. In particular, in order to obtain the belief-completeness in a constructive way, we extend the work of Meier [An Infinitary Probability Logic for Type Spaces. Israel Journal of Mathematics, 192, 1-58] by proving strong soundness and strong completeness of an infinitary conditional probability logic with truthful and non-epistemic conditioning events.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125409818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Cheryl's Birthday 谢丽尔的生日
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-27 DOI: 10.4204/EPTCS.251.1
H. V. Ditmarsch, M. Hartley, Barteld P. Kooi, J. Welton, Joseph B. W. Yeo
{"title":"Cheryl's Birthday","authors":"H. V. Ditmarsch, M. Hartley, Barteld P. Kooi, J. Welton, Joseph B. W. Yeo","doi":"10.4204/EPTCS.251.1","DOIUrl":"https://doi.org/10.4204/EPTCS.251.1","url":null,"abstract":"We present four logic puzzles and after that their solutions. Joseph Yeo designed 'Cheryl's Birthday'. Mike Hartley came up with a novel solution for 'One Hundred Prisoners and a Light Bulb'. Jonathan Welton designed 'A Blind Guess' and 'Abby's Birthday'. Hans van Ditmarsch and Barteld Kooi authored the puzzlebook 'One Hundred Prisoners and a Light Bulb' that contains other knowledge puzzles, and that can also be found on the webpage http://personal.us.es/hvd/lightbulb.html dedicated to the book.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"528 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116706399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Common Knowledge in a Logic of Gossips 八卦逻辑中的常识
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-26 DOI: 10.4204/EPTCS.251.2
K. Apt, D. Wojtczak
{"title":"Common Knowledge in a Logic of Gossips","authors":"K. Apt, D. Wojtczak","doi":"10.4204/EPTCS.251.2","DOIUrl":"https://doi.org/10.4204/EPTCS.251.2","url":null,"abstract":"Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other secrets. Recently a number of authors studied distributed epistemic gossip protocols. These protocols use as guards formulas from a simple epistemic logic, which makes their analysis and verification substantially easier. \u0000We study here common knowledge in the context of such a logic. First, we analyze when it can be reduced to iterated knowledge. Then we show that the semantics and truth for formulas without nested common knowledge operator are decidable. This implies that implementability, partial correctness and termination of distributed epistemic gossip protocols that use non-nested common knowledge operator is decidable, as well. Given that common knowledge is equivalent to an infinite conjunction of nested knowledge, these results are non-trivial generalizations of the corresponding decidability results for the original epistemic logic, established in (Apt & Wojtczak, 2016). \u0000K. R. Apt & D. Wojtczak (2016): On Decidability of a Logic of Gossips. In Proc. of JELIA 2016, pp. 18-33, doi:10.1007/ 978-3-319-48758-8_2.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121569768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Toward an Epistemic-Logical Theory of Categorization 论范畴的认识论-逻辑理论
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-25 DOI: 10.4204/EPTCS.251.12
Willem Conradie, S. Frittella, A. Palmigiano, M. Piazzai, A. Tzimoulis, N. Wijnberg
{"title":"Toward an Epistemic-Logical Theory of Categorization","authors":"Willem Conradie, S. Frittella, A. Palmigiano, M. Piazzai, A. Tzimoulis, N. Wijnberg","doi":"10.4204/EPTCS.251.12","DOIUrl":"https://doi.org/10.4204/EPTCS.251.12","url":null,"abstract":"Categorization systems are widely studied in psychology, sociology, and organization theory as information-structuring devices which are critical to decision-making processes. In the present paper, we introduce a sound and complete epistemic logic of categories and agents' categorical perception. The Kripke-style semantics of this logic is given in terms of data structures based on two domains: one domain representing objects (e.g. market products) and one domain representing the features of the objects which are relevant to the agents' decision-making. We use this framework to discuss and propose logic-based formalizations of some core concepts from psychological, sociological, and organizational research in categorization theory.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115342131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Bisimulation in Inquisitive Modal Logic 探究式模态逻辑中的双仿真
Theoretical Aspects of Rationality and Knowledge Pub Date : 2017-07-25 DOI: 10.4204/EPTCS.251.11
Ivano Ciardelli, M. Otto
{"title":"Bisimulation in Inquisitive Modal Logic","authors":"Ivano Ciardelli, M. Otto","doi":"10.4204/EPTCS.251.11","DOIUrl":"https://doi.org/10.4204/EPTCS.251.11","url":null,"abstract":"Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic, and characterise inquisitive modal logic as the bisimulation invariant fragments of first-order logic over various classes of two-sorted relational structures. These results crucially require non-classical methods in studying bisimulations and first-order expressiveness over non-elementary classes.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"156 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114107719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信