Knowledge Sharing in Coalitions
The aim of this paper is to investigate the interplay between knowledge shared by a group of agents and its coalition ability. We investigate this relation in the standard context of imperfect information concurrent game. We assume that whenever a set of agents form a coalition to achieve a goal, they share their knowledge before acting. Based on this assumption, we propose a new semantics for alternating-time temporal logic with imperfect information and perfect recall. It turns out that this semantics is sufficient to preserve all the desirable properties of coalition ability in traditional coalitional logics. Meanwhile, we investigate how knowledge sharing within a group of agents contributes to its coalitional ability through the interplay of epistemic and coalition modalities. This work provides a partial answer to the question: which kind of group knowledge is required for a group to achieve their goals in the context of imperfect information.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Long Coalition Leads to Shrink? The Roles of Tipping and Technology-Sharing in Climate Clubs
Global cooperation is posited as a pivotal solution to address climate change, yet significant barriers, like free-riding, hinder its realization. This paper develops a dynamic game-theoretic model to analyze the stabili…
Solidarity to achieve stability
Agents may form coalitions. Each coalition shares its endowment among its agents by applying a sharing rule. The sharing rule induces a coalition formation problem by assuming that agents rank coalitions according to the…
Secure Architectures Implementing Trusted Coalitions for Blockchained Distributed Learning (TCLearn)
Distributed learning across a coalition of organizations allows the members of the coalition to train and share a model without sharing the data used to optimize this model. In this paper, we propose new secure architect…
Distributed OptimizationFree-Rider and Conflict Aware Collaboration Formation for Cross-Silo Federated Learning
Federated learning (FL) is a machine learning paradigm that allows multiple FL participants (FL-PTs) to collaborate on training models without sharing private data. Due to data heterogeneity, negative transfer may occur …
Federated LearningComputing Stable Coalitions: Approximation Algorithms for Reward Sharing
Consider a setting where selfish agents are to be assigned to coalitions or projects from a fixed set P. Each project k is characterized by a valuation function; v_k(S) is the value generated by a set S of agents working…