Logic for coalitions with bounded resources

DOI10.1093/logcom/exq032zbMath1252.03036OpenAlexW2061572317MaRDI QIDQ3103974

Abdur Rakib, Brian Logan, Natasha Alechina, Hoang Nga Nguyen

Publication date: 19 December 2011

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exq032

zbMATH Keywords

resourcescoalition logic

Mathematics Subject Classification ID

Cooperative games (91A12) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (10)

State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems ⋮ Verifying Systems of Resource-Bounded Agents ⋮ Logical omniscience as infeasibility ⋮ Formal modelling and verification of probabilistic resource bounded agents ⋮ Coalition formation in social environments with logic-based agents1 ⋮ The virtues of idleness: a decidable fragment of resource agent logic ⋮ On composition of bounded-recall plans ⋮ On a Logic for Coalitional Games with Priced-Resource Agents ⋮ Information Flow Under Budget Constraints ⋮ Knowing the price of success

This page was built for publication: Logic for coalitions with bounded resources