Searching for overlapping coalitions in multiple virtual organizations

Zhang, Guofu; Jiang, Jianguo; Su, Zhaopin; Qi, Meibin; Fang, Hua

doi:10.1016/j.ins.2010.04.028

Cited by 29 publications

(14 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Agent-based virtual organizations can provide new capacities to create artificial societies. This area has grown during recent years with most studies focused on security [ 43 ], planning [ 44 ], role assignment [ 45 ], resource management [ 46 ], collaboration [ 47 ], etc . However, it is not possible to find approaches based on virtual organizations of agents and ambient intelligence, where agents can be embedded in resource-constrained devices.…”

Section: Related Workmentioning

confidence: 99%

Ambient Agents: Embedded Agents for Remote Control and Monitoring Using the PANGEA Platform

Villarrubia

Paz

Bajo

et al. 2014

Sensors

View full text Add to dashboard Cite

Ambient intelligence has advanced significantly during the last few years. The incorporation of image processing and artificial intelligence techniques have opened the possibility for such aspects as pattern recognition, thus allowing for a better adaptation of these systems. This study presents a new model of an embedded agent especially designed to be implemented in sensing devices with resource constraints. This new model of an agent is integrated within the PANGEA (Platform for the Automatic Construction of Organiztions of Intelligent Agents) platform, an organizational-based platform, defining a new sensor role in the system and aimed at providing contextual information and interacting with the environment. A case study was developed over the PANGEA platform and designed using different agents and sensors responsible for providing user support at home in the event of incidents or emergencies. The system presented in the case study incorporates agents in Arduino hardware devices with recognition modules and illuminated bands; it also incorporates IP cameras programmed for automatic tracking, which can connect remotely in the event of emergencies. The user wears a bracelet, which contains a simple vibration sensor that can receive notifications about the emergency situation.

show abstract

Section: Related Workmentioning

confidence: 99%

Ambient Agents: Embedded Agents for Remote Control and Monitoring Using the PANGEA Platform

Villarrubia

Paz

Bajo

et al. 2014

Sensors

View full text Add to dashboard Cite

show abstract

“…Incentives and optimization in collaborative multi-agent environments have received plenty of attention from the multiagent research community (Sims, Corkill, & Lesser, 2008;Airiau & Sen, 2009;Rahwan & Jennings, 2008;Dang, Dash, Rogers, & Jennings, 2006;Shehory & Kraus, 1996;Lin & Hu, 2007;Zhang, Jiang, Su, Qi, & Fang, 2010); see also the PhD thesis of Rahwan (2007) and the recent book of Chalkiadakis, Elkind, and Wooldridge (2011) for an overview. These studies often use cooperative game theory as the modeling framework.…”

Section: Related Workmentioning

confidence: 99%

Arbitration and Stability in Cooperative Games with Overlapping Coalitions

Zick¹,

Markakis²,

Elkind³

2014

jair

View full text Add to dashboard Cite

Overlapping Coalition Formation (OCF) games, introduced by Chalkiadakis, Elkind, Markakis, Polukarov and Jennings in 2010, are cooperative games where players can simultaneously participate in several coalitions. Capturing the notion of stability in OCF games is a difficult task: deviating players may continue to contribute resources to joint projects with non-deviators, and the crucial question is what payoffs the deviators expect to receive from such projects. Chalkiadakis et al. introduce three stability concepts for OCF games-the conservative core, the refined core, and the optimistic core-that are based on different answers to this question. In this paper, we propose a unified framework for the study of stability in the OCF setting, which encompasses the stability concepts considered by Chalkiadakis et al. as well as a wide variety of alternative stability concepts. Our approach is based on the notion of arbitration functions, which determine the payoff obtained by the deviators, given their deviation and the current allocation of resources. We provide a characterization of stable outcomes under arbitration. We then conduct an in-depth study of four types of arbitration functions, which correspond to four notions of the core; these include the three notions of the core considered by Chalkiadakis et al. Our results complement those of Chalkiadakis et al. and answer questions left open by their work. In particular, we show that OCF games with the conservative arbitration function are essentially equivalent to non-OCF games, by relating the conservative core of an OCF game to the core of a non-overlapping cooperative game, and use this result to obtain a strictly weaker sufficient condition for conservative core non-emptiness than the one given by Chalkiadakis et al.

show abstract

“…It uses a discrete parameter space, where its position in each dimension can be either 0 or 1. Binary PSO is used for instance by Zhang et al to tackle the problem of overlapping coalition formation in multi-agent systems, particularly agents participating in multiple virtual organisations [33]. More recently there has been work on discrete PSO, which uses a more relaxed notion of dimensionality.…”

Section: Particle Swarm Optimisationmentioning

confidence: 99%

Discrete particle swarm optimisation for ontology alignment

Bock

Hettenhausen

2012

Information Sciences

113

View full text Add to dashboard Cite

Particle Swarm Optimisation (PSO) is a biologically-inspired, population-based optimisation technique that has been successfully applied to various problems in science and engineering. In the context of semantic technologies, optimisation problems also occur but have rarely been considered as such. This work addresses the problem of ontology alignment, which is the identification of overlaps in heterogeneous knowledge bases backing semantic applications. To this end, the ontology alignment problem is revisited as an optimisation problem. A discrete particle swarm optimisation algorithm is designed in order to solve this optimisation problem and compute an alignment of two ontologies. A number of characteristics of traditional PSO algorithms are partially relaxed in this article, such as fixed dimensionality of particles. A complex fitness function based on similarity measures of ontological entities, as well as a tailored particle update procedure are presented. This approach brings several benefits for solving the ontology alignment problem, such as inherent parallelisation, anytime behaviour, and flexibility according to the characteristics of particular ontologies. The presented algorithm has been implemented under the name MapPSO (Ontology Mapping using Particle Swarm Optimisation). Experiments demonstrate that applying PSO in the context of ontology alignment is a feasible approach.

show abstract

Searching for overlapping coalitions in multiple virtual organizations

Cited by 29 publications

References 41 publications

Ambient Agents: Embedded Agents for Remote Control and Monitoring Using the PANGEA Platform

Ambient Agents: Embedded Agents for Remote Control and Monitoring Using the PANGEA Platform

Arbitration and Stability in Cooperative Games with Overlapping Coalitions

Discrete particle swarm optimisation for ontology alignment

Contact Info

Product

Resources

About