Budget-Constrained Dynamics in Multiagent Systems

Cao, Rui; Naumov, Pavel

doi:10.24963/ijcai.2017/127

Cited by 5 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In such settings, resources would be treated as a cost of some 'information mining' process for agents. A similar proposal introduced a logical system for reasoning about budgetconstrained knowledge [41]. This approach, however, deals with resource bounded knowledge statically, while we introduce a DELstyle framework.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Epistemic Logic for Budget-Constrained Agents

Dolgorukov

Gladyshev²

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Logics for resource-bounded agents have been getting more and more attention in recent years since they provide us with more realistic tools for modelling and reasoning about multi-agent systems. While many existing approaches are based on the idea of agents as imperfect reasoners, who must spend their resources to perform logical inference, this is not the only way to introduce resource constraints into logical settings. In this paper we study agents as perfect reasoners, who may purchase a new piece of information from a trustworthy source. For this purpose we propose dynamic epistemic logic for semi-public queries for resource-bounded agents. In this logic (groups of) agents can perform a query (ask a question) about whether some formula is true and receive a correct answer. These queries are called semi-public, because the very fact of the query is public, while the answer is private. We also assume that every query has a cost and every agent has a budget constraint. Finally, our framework allows us to reason about group queries, in which agents may share resources to obtain a new piece of information together. We demonstrate that our logic is complete, decidable and has an efficient model checking procedure.

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic Epistemic Logic for Budget-Constrained Agents

Dolgorukov

Gladyshev²

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…(Alechina et al 2011) introduce resource-bounded coalitional logic (RBCL). A logical system with a modality labeled by budget and profit is introduced in (Cao and Naumov 2017).…”

Section: Ethical Dilemma Vs Coalition Powermentioning

confidence: 99%

Ethical Dilemmas in Strategic Games

Naumov

Yew

2021

AAAI

Self Cite

View full text Add to dashboard Cite

An agent, or a coalition of agents, faces an ethical dilemma between several statements if she is forced to make a conscious choice between which of these statements will be true. This paper proposes to capture ethical dilemmas as a modality in strategic game settings with and without limit on sacrifice and for perfect and imperfect information games. The authors show that the dilemma modality cannot be defined through the earlier proposed blameworthiness modality. The main technical result is a sound and complete axiomatization of the properties of this modality with sacrifice in games with perfect information.

show abstract

“…Alechina, Logan, Nga, and Rakib proposed a version of coalition logic with bounded resources [35]. Cao and Naumov developed a logic of strategic power with bounded cost and profit [36]. Alur, Henzinger, and Kupferman introduced Alternating-Time Temporal Logic (ATL) that combines temporal and coalition modalities [37].…”

Section: Literature Reviewmentioning

confidence: 99%