#### Filter Results:

- Full text PDF available (35)

#### Publication Year

2003

2018

- This year (3)
- Last 5 years (19)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We show exact values for the price of anarchy of weighted and unweighted congestion games with polynomial latency functions. The given values also hold for weighted and unweighted network congestionâ€¦ (More)

- Martin Gairing, Thomas LÃ¼cking, Marios Mavronicolas, Burkhard Monien
- Theory of Computing Systems
- 2004

We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problemâ€¦ (More)

- Martin Gairing
- WINE
- 2009

We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied max-n-cover problem.â€¦ (More)

- Martin Gairing, Rahul Savani
- SAGT
- 2010

We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected edge-weighted graph:â€¦ (More)

- Martin Gairing, Thomas LÃ¼cking, Marios Mavronicolas, Burkhard Monien
- Parallel Processing Letters
- 2006

In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed links for the user. Inâ€¦ (More)

- Tobias Friedrich, Martin Gairing, Thomas Sauerwald
- SODA
- 2010

We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random algorithm by keepingâ€¦ (More)

- Martin Gairing, Burkhard Monien, Andreas Wotzlaw
- ICALP
- 2005

We consider the problem of scheduling n independent jobs on m unrelated parallel machines without preemption. Job i takes processing time pij on machine j, and the total time used by a machine is theâ€¦ (More)

- Martin Gairing, Burkhard Monien, Karsten Tiemann
- ICALP
- 2006

In this work we study weighted network congestion games with playerspecificlatency functions where selfish playerswish to route theirtraffic through a sharednetwork. We consider both the case ofâ€¦ (More)

We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as isâ€¦ (More)