On a Logic for Coalitional Games with Priced-Resource Agents
DOI10.1016/j.entcs.2011.10.017zbMath1347.68337OpenAlexW2023074074WikidataQ113318187 ScholiaQ113318187MaRDI QIDQ2825419
Dario Della Monica, Margherita Napoli
Publication date: 7 October 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.017
Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44) Agent technology and artificial intelligence (68T42)
Related Items (11)
Cites Work
- Solving coalitional resource games
- On the (un-)decidability of model-checking resource-bounded agents
- Expressing Properties of Resource-Bounded Systems: The Logics RTL * and RTL
- Logic for coalitions with bounded resources
- Alternating-time temporal logic
- A Modal Logic for Coalitional Power in Games
- Alternating-time temporal logic with resource bounds
This page was built for publication: On a Logic for Coalitional Games with Priced-Resource Agents