On a Logic for Coalitional Games with Priced-Resource Agents

Monica, Dario Della; Napoli, Margherita; Parente, Mimmo

doi:10.1016/j.entcs.2011.10.017

Cited by 25 publications

(25 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10] it has been shown that CL can be embedded into ATL. Recently, these two logics have been used for the verification of multi-agent systems (MAS), enhanced with resource constraints [1,2,5,6,9]. The intuitive idea is that agent actions consume and/or produce resources, thus the choice of a given action of an agent is subject to the availability of the resources.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRB-ATL), introduced in [9], but in a much less mature version. The key features of this new approach toward the formalization of such complex systems can be summarized as follows.…”

Section: Introductionmentioning

confidence: 99%

“…We give unlimited economic power to the agents in the opponent team, in the sense that at each moment they have money enough to acquire the resources they need for a move, provided that the resources are available. Actually in [9] an EXPTIME algorithm for the model checking problem was given, along with a PSPACE lower bound. The main technical contribution here is to provide an EXPTIME lower bound for the model checking problem for PRB-ATL.…”

Section: Introductionmentioning

confidence: 99%

“…The hardness proof is obtained by means of a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines (LB-ATM), known to be EXPTIME-complete [7], to the model checking problem for PRB-ATL. More precisely, let n be the number of agents, r the number of resources, and M the maximum component occurring in the initial resource availability vector, the algorithm given in [9] runs in exponential time in n, r, and the size of the representation of M (assuming that M is represented in binary). To prove here the inherent difficulty with respect to multiple input parameters, we show two reductions: one parametric in the representation of M (the digit size), that assumes constant both n and r, and another parametric in r, and assuming constant both n and the value of M.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Model checking coalitional games in shortage resource scenarios

Monica¹,

Napoli²,

Parente³

2013

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Verification of multi-agents systems (MAS) has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL), whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula) to a semantic one (part of the model). This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model checking coalitional games in shortage resource scenarios

Monica¹,

Napoli²,

Parente³

2013

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Other decidability results for bounded resource logics have also been reported in the literature. For example, [20] define a decidable logic, PRB-ATL (Priced Resource-Bounded ATL), where the total amount of resources in the system has a fixed bound. The model-checking algorithm for PRB-ATL requires time polynomial in the size of the model and exponential in the number of resource types and the resource bound on the system.…”

Section: Adding Productionmentioning

confidence: 99%

Verifying Systems of Resource-Bounded Agents

Alechina

Logan

2016

Pursuit of the Universal

View full text Add to dashboard Cite

Abstract. Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions. However such approaches often ignore a key aspect of multi-agent systems, namely that the agents' actions require (and sometimes produce) resources. We briefly survey previous work on the verification of multi-agent systems that takes resources into account, and outline some key challenges for future work.

show abstract

Fields of Logic and Computation III

Vovk

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions. However such approaches often ignore a key aspect of multi-agent systems, namely that the agents' actions require (and sometimes produce) resources. We survey previous work on the verification of multi-agent systems that takes resources into account, extending substantially a survey from 2016 [9].

show abstract

On a Logic for Coalitional Games with Priced-Resource Agents

Cited by 25 publications

References 5 publications

Model checking coalitional games in shortage resource scenarios

Model checking coalitional games in shortage resource scenarios

Verifying Systems of Resource-Bounded Agents

Fields of Logic and Computation III

Contact Info

Product

Resources

About