A Branch and Bound Algorithm for Coalition Structure Generation over Graphs

Coalition Structure Generation over Graphs

We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) \to R 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. This problem is generally NP-complete; in particular, it is hard for a defined class of valuation functions which are independent of disconnected members - that is, two nodes have no effect on each other's marginal contribution to their vertex separator. Nonetheless, for all such fun…

面向大规模联盟结构生成的多智能体路径搜索算法

A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation

针对大规模联盟结构生成问题，提出在联盟结构图上搜索的任意时间多智能体算法SALDAE，可快速处理数千智能体并在多个标准基准上优于现有方法。

On the Verification and Computation of Strong Nash Equilibrium

Computing equilibria of games is a central task in computer science. A large number of results are known for \emph{Nash equilibrium} (NE). However, these can be adopted only when coalitions are not an issue. When instead agents can form coalitions, NE is inadequate and an appropriate solution concept is \emph{strong Nash equilibrium} (SNE). Few computational results are known about SNE. In this paper, we first study the problem of verifying whether a strategy profile is an SNE, showing that the problem is in $\mathcal{P}$. We then design a spatial branch--and--bound algorithm to find an SNE, a…

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. This problem is generally NP--complete; in particular, it is hard for a defined class of valuation functions which are {\it independent of disconnected members}---that is, two nodes have no effect on each other's marginal contribution to their vertex separator. …

概率联盟结构的贝叶斯恢复

Bayesian Recovery for Probabilistic Coalition Structures

本文研究了概率联盟结构生成问题，发现标准稀疏方法在重叠联盟情况下失效，而基于高斯-伽马层次结构的稀疏贝叶斯学习能有效恢复最优联盟结构。

从项链到联盟：公平且利己的联盟价值计算分配

From Necklaces to Coalitions: Fair and Self-Interested Distribution of Coalition Value Calculations

本文提出N-DCA算法，通过增量数组框架实现无需通信的公平联盟价值分配，满足均衡、无冗余、负载平衡和自利性等五项属性。

On the theory and applications of mechanism design and coalitional games in electricity markets

Although the specific structures of electricity markets are diverse around the world, they were all conceived on the premise of predictable, controllable generation with nonnegligible marginal costs. Recent changes, specifically, the increasing renewable integration, have challenged such assumptions. In light of this shift, this thesis intends to devise new frameworks and advance our understanding of the future markets. The first part focuses on mechanism design when the model fully reflects the physics of the grid and the participants. We consider a market that involves continuous goods, gene…

A Coalition Formation Game Framework for Peer-to-Peer Energy Trading

This paper studies social cooperation backed peer-to-peer energy trading technique by which prosumers can decide how they can use their batteries opportunistically for participating in the peer-to-peer trading. The objective is to achieve a solution in which the ultimate beneficiaries are the prosumers, i.e., a prosumer-centric solution. To do so, a coalition formation game is designed, which enables a prosumer to compare its benefit of participating in the peer-to-peer trading with and without using its battery and thus, allows the prosumer to form suitable social coalition groups with other …

Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents

Autonomous wireless agents such as unmanned aerial vehicles or mobile base stations present a great potential for deployment in next-generation wireless networks. While current literature has been mainly focused on the use of agents within robotics or software applications, we propose a novel usage model for self-organizing agents suited to wireless networks. In the proposed model, a number of agents are required to collect data from several arbitrarily located tasks. Each task represents a queue of packets that require collection and subsequent wireless transmission by the agents to a central…

Fair cost allocation for ridesharing services - modeling, mathematical programming and an algorithm to find the nucleolus

This paper addresses one of the most challenging issues in designing an efficient and sustainable ridesharing service: ridesharing market design. We formulate it as a fair cost allocation problem through the lens of the cooperative game theory. A special property of the cooperative ridesharing game is that its characteristic function values are calculated by solving an optimization problem. Several concepts of fairness are investigated and special attention is paid to a solution concept named nucleolus, which aims to minimize the maximum dissatisfaction in the system. Due to its computational …