Theoretical Aspects of Rationality and Knowledge最新文献_第3页

Collective Argumentation: The Case of Aggregating Support-Relations of Bipolar Argumentation Frameworks 集体论证:双极性论证框架的聚合支持关系

Theoretical Aspects of Rationality and Knowledge Pub Date : 2021-06-22 DOI: 10.4204/EPTCS.335.8

Weiwei Chen

引用次数: 0

Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems 通信模式模型:动态网络分布式系统动作模型的扩展

Theoretical Aspects of Rationality and Knowledge Pub Date : 2021-06-22 DOI: 10.4204/EPTCS.335.29

Diego A. Vel'azquez, Armando Castañeda, D. Rosenblueth

{"title":"Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems","authors":"Diego A. Vel'azquez, Armando Castañeda, D. Rosenblueth","doi":"10.4204/EPTCS.335.29","DOIUrl":"https://doi.org/10.4204/EPTCS.335.29","url":null,"abstract":"Halpern and Moses were the first to recognize, in 1984, the importance of a formal treatment of knowledge in distributed computing. Many works in distributed computing, however, still employ informal notions of knowledge. Hence, it is critical to further study such formalizations. Action models, a significant approach to modeling dynamic epistemic logic, have only recently been applied to distributed computing, for instance, by Goubault, Ledent, and Rajsbaum. Using action models for analyzing distributed-computing environments, as proposed by these authors, has drawbacks, however. In particular, a direct use of action models may cause such models to grow exponentially as the computation of the distributed system evolves. Hence, our motivation is finding compact action models for distributed systems. We introduce communication pattern models as an extension of both ordinary action models and their update operator. We give a systematic construction of communication pattern models for a large variety of distributed-computing models called dynamic-network models. For a proper subclass of dynamic-network models called oblivious, the communication pattern model remains the same throughout the computation.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132277792","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

Game-theoretic Models of Moral and Other-Regarding Agents 道德和他者行为的博弈论模型

Theoretical Aspects of Rationality and Knowledge Pub Date : 2020-12-17 DOI: 10.4204/EPTCS.335.19

Gabriel Istrate

引用次数: 2

Strategic Voting Under Uncertainty About the Voting Method 投票方式不确定性下的策略性投票

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.17

W. Holliday, E. Pacuit

引用次数: 1

Aggregating Probabilistic Judgments 聚合概率判断

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.18

Magdalena Ivanovska, M. Slavkovik

引用次数: 1

Learning Probabilities: Towards a Logic of Statistical Learning 学习概率:迈向统计学习的逻辑

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.3

A. Baltag, S. R. Rad, S. Smets

{"title":"Learning Probabilities: Towards a Logic of Statistical Learning","authors":"A. Baltag, S. R. Rad, S. Smets","doi":"10.4204/EPTCS.297.3","DOIUrl":"https://doi.org/10.4204/EPTCS.297.3","url":null,"abstract":"We propose a new model for forming beliefs and learning about unknown probabilities (such as the probability of picking a red marble from a bag with an unknown distribution of coloured marbles). The most widespread model for such situations of 'radical uncertainty' is in terms of imprecise probabilities, i.e. representing the agent's knowledge as a set of probability measures. We add to this model a plausibility map, associating to each measure a plausibility number, as a way to go beyond what is known with certainty and represent the agent's beliefs about probability. There are a number of standard examples: Shannon Entropy, Centre of Mass etc. We then consider learning of two types of information: (1) learning by repeated sampling from the unknown distribution (e.g. picking marbles from the bag); and (2) learning higher-order information about the distribution (in the shape of linear inequalities, e.g. we are told there are more red marbles than green marbles). The first changes only the plausibility map (via a 'plausibilistic' version of Bayes' Rule), but leaves the given set of measures unchanged; the second shrinks the set of measures, without changing their plausibility. Beliefs are defined as in Belief Revision Theory, in terms of truth in the most plausible worlds. But our belief change does not comply with standard AGM axioms, since the revision induced by (1) is of a non-AGM type. This is essential, as it allows our agents to learn the true probability: we prove that the beliefs obtained by repeated sampling converge almost surely to the correct belief (in the true probability). We end by sketching the contours of a dynamic doxastic logic for statistical learning.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133542547","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

Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems 拜占庭多智能体系统中的因果关系和认知推理

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.19

R. Kuznets, Laurent Prosperi, U. Schmid, Krisztina Fruzsa

引用次数: 5

Uncertainty About Evidence 证据的不确定性

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.5

Adam Bjorndahl, Aybüke Özgün

引用次数: 5

Measuring Belief and Risk Attitude 测量信念和风险态度

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.22

Sven Neth

引用次数: 1

A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator 利用“全部我知道”算子对迭代可容许性的概念上有充分根据的刻画

Theoretical Aspects of Rationality and Knowledge Pub Date : 2019-07-19 DOI: 10.4204/EPTCS.297.15

Joseph Y. Halpern, R. Pass

{"title":"A Conceptually Well-Founded Characterization of Iterated Admissibility Using an \"All I Know\" Operator","authors":"Joseph Y. Halpern, R. Pass","doi":"10.4204/EPTCS.297.15","DOIUrl":"https://doi.org/10.4204/EPTCS.297.15","url":null,"abstract":"Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (IA), also known as iterated deletion of weakly dominated strategies, where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called a complete structure, where all types are possible. In earlier work, we gave a characterization of iterated admissibility using an \"all I know\" operator, that captures the intuition that \"all the agent knows\" is that agents satisfy the appropriate rationality assumptions. That characterization did not need complete structures and used probability structures, not LPSs. However, that characterization did not deal with Samuelson's conceptual concern regarding IA, namely, that at higher levels, players do not consider possible strategies that were used to justify their choice of strategy at lower levels. In this paper, we give a characterization of IA using the all I know operator that does deal with Samuelson's concern. However, it uses LPSs. We then show how to modify the characterization using notions of \"approximate belief\" and \"approximately all I know\" so as to deal with Samuelson's concern while still working with probability structures.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759673","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