Multi-agent dependence by dependence graphs
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Introduction to Algorithms
Forming dynamic coalitions of rational agents by use of the DCF-S scheme
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Power and Dependence Relations in Groups of Agents
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Conviviality masks in multiagent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Methods for task allocation via agent coalition formation
Artificial Intelligence
Proceedings of the 5th ACM/IEEE international conference on Human-robot interaction
Dependence theory via game theory
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Hi-index | 0.00 |
Conviviality has been introduced as a social science concept for multiagent systems to highlight soft qualitative requirements like user friendliness of systems. In this paper we introduce formal conviviality measures for dependence networks using a coalitional game theoretic framework, which we contrast with more traditional efficiency and stability measures. Roughly, more opportunities to work with other people increases the conviviality, whereas larger coalitions may decrease the efficiency or stability of these involved coalitions. We first introduce assumptions and requirements, then we introduce a classification, and finally we introduce the conviviality measures. We use a running example from robotics to illustrate the measures.