Multi-agent dependence by dependence graphs
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Dependencies Between Players in Boolean Games
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Strengthening Admissible Coalitions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Dependence in games and dependence games
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Cooperative boolean games are coalitional games with both goals and costs associated to actions, and dependence networks for boolean games are a kind of social networks representing how the actions of other agents have an influence on the achievement of an agent's goal. In this paper, we introduce two new types of dependence networks, called the abstract dependence network and the refined dependence network . Moreover, we show that the notion of stability is complete with respect to the solution concept of the core in the case of cooperative boolean games with costly actions. We present a reduction, called Δ-reduction , to pass from a cooperative boolean game G to game G *** without loosing solutions.