Results 21 to 30 of about 189,811 (255)
Anytime coalition structure generation on synergy graphs [PDF]
We consider the coalition structure generation (CSG) problem on synergy graphs, which arises in many practical applications where communication constraints, social or trust relationships must be taken into account when forming coalitions.
Bistaffa, Filippo +4 more
core +1 more source
Grasp and Path-Relinking for Coalition Structure Generation [PDF]
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition (maximizing a social welfare) of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning (set covering machines ...
DI MAURO, NICOLA +3 more
openaire +3 more sources
With the dense deployment of small cells in the next generation of mobile networks, the users from different tiers suffer from high downlink interferences. In this paper, we propose a game theoretic approach for joint co-tier and cross-tier collaboration
Mouna Hajir +2 more
doaj +1 more source
Transforming Energy Networks via Peer to Peer Energy Trading: Potential of Game Theoretic Approaches [PDF]
Peer-to-peer (P2P) energy trading has emerged as a next-generation energy management mechanism for the smart grid that enables each prosumer of the network to participate in energy trading with one another and the grid. This poses a significant challenge
Mohsenian-Rad, Hamed +5 more
core +2 more sources
Informing Coalition Structure Generation in Multi-Agent Systems Through Emotion Modelling [PDF]
We propose a hybrid coalition formation method for multi-agent systems that combines a rational mechanism and an emotionally-inspired mechanism to reduce the associated computational cost.
Lloyd-Kelly, Martyn, Riley, Luke
core +1 more source
Graph Coalition Structure Generation
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to find a partition of $N$ into connected subsets, that maximises the sum of the components' values.
Voice, Thomas D. +2 more
openaire +2 more sources
Complexity of Determining Nonemptiness of the Core [PDF]
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish things that the individual agents cannot, or can do things more efficiently ...
Conitzer, Vincent, Sandholm, Tuomas
core +5 more sources
Coalition Structure Generation on Graphs
Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition structure generation problem [5].
Rahwan, Talal, Michalak, Tomasz P.
openaire +2 more sources
ABSTRACT Background Nurses are central to cancer care for children and adolescents, yet no comprehensive synthesis has defined essential core competencies for pediatric oncology nursing (PON) practice internationally, particularly in Latin America and the Caribbean (LAC).
Luís Carlos Lopes‐Júnior +7 more
wiley +1 more source
ABSTRACT Background Families of children with cancer experience significant financial strain, even with universal healthcare. Indirect costs, such as productivity losses and non‐medical expenses, are rarely included in economic evaluations, and little is known about how effectively financial aid programmes alleviate this burden. Childhood brain tumours
Megumi Lim +8 more
wiley +1 more source

