Loading in 2 Seconds...

Overlapping Coalition Formation: Charting the Tractability Frontier

Loading in 2 Seconds...

- 62 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' Overlapping Coalition Formation: Charting the Tractability Frontier' - norina

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

### Overlapping Coalition Formation: Charting the Tractability Frontier

Y. Zick, G. Chalkiadakis and E. Elkind

(AAMAS 2012)

Framework

Each player has a divisible resource (in our model, an integer weight).

A coalition is formed by agents contributing some of their weight to a certain collaborative task.

OCF Games [Chalkiadakis et. al, 2010]:

Framework

Goal: find an optimal coalition structure; divide coalitional payoffs in a stable manner.

- One Key Issue: the stability of a payoff division highly depends on the behavior of non-deviators (arbitration functions [Zick and Elkind, 2011]).

NP-hardness

Finding optimal coalition structures/stable payoff allocations is known to be NP-hard:

The objective of our work is to identify conditions that make optimization and stability tractable.

2-OCF Games

Agents may form coalitions of at most size 2:

- If agent icontributesxand agent jcontributesy, the value of interaction isvi,j(x,y)
- If an agent iinvests xin working alone, he makes vi(x)

Problem Model

The problem can be modeled as a graph

Agents are weighted nodes

- Node value: vi(x)
- Edge value: vi,j(x,y)

- Goal #1: optimal allocation

Optimal Coalition Structure

Computational complexity:

computing an optimal allocation is NP-hard even for a single agent (the KNAPSACKproblem).

One agent with large weight – find the optimal set of tasks to complete.

Optimal Coalition Structure

Theorem:

computing an optimal allocation for a constant # of agents can be done in poly(W+1) time, where Wis the maximal weight of any agent.

Computational complexity: even when weights are at most 3, complex interactions cause NP-hardness (the X3C problem).

We assume that:

- Weights are small
- Interactions are simple.

Optimal Coalition Structure

Suppose that the interaction graph is a tree

w8

w1

v8

v5,8

v1,2(x,y)

v1,5(x,y)

v1(x)

w2

w5

v5,9

v1,3(x,y)

w9

v2

v5

v9

w3

v5,7

v3,4

v3,6

v3

w7

w6

w4

v7

v6

v4

Optimal Coalition Structure

Theorem:

if the interaction graph is a tree, an optimal allocation can be computed in time linear in the # of agents and polynomial in (W+1).

Stability

Arbitration functions: Given a set’s deviation from an outcome, how much will it get from surviving agreements with non-deviators?

Stability

Theorem:

if there is an efficient algorithm to compute the most one can get from global arbitration functions, then P = NP.

Stability

Theorem:

if the arbitration function is local, and the interaction graph is a tree, then one can verify if an outcome is stable in poly(n,W+1) time.

More Results

Bounded hyper-treewidth: Our results can be extended to graphs with bounded hyper-treewidth.

If the graph is “tree-like”we can still obtain efficient algorithms.

Summary

Computational Issues: A major obstacle in OCF games.

But:if interactions are (somewhat) local, both for values and arbitration functions, we can obtain poly-time algorithms.

Questions?

Download Presentation

Connecting to Server..