#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2006

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Janina A. Brenner, Guido Schäfer
- STACS
- 2007

Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. While we prove a lower bound of Ω(logn) for a very general class of problems, we give a… (More)

- Janina A. Brenner, Guido Schäfer
- Theor. Comput. Sci.
- 2008

Classical results in economics show that no truthful mechanism can achieve budget balance and efficiency simultaneously. Roughgarden and Sundararajan recently proposed an alternative efficiency measure, which was subsequently used to exhibit that many previously known cost sharing mechanisms approximate both budget balance and efficiency. In this work, we… (More)

- Janina A. Brenner, Guido Schäfer
- SAGT
- 2008

Mehta, Roughgarden, and Sundararajan recently introduced a new class of cost sharing mechanisms called acyclic mechanisms. These mechanisms achieve a slightly weaker notion of truthfulness than the well-known Moulin mechanisms, but provide additional freedom to improve budget balance and social cost approximation guarantees. In this paper, we investigate… (More)

- Janina A. Brenner, Guido Schäfer
- CIAC
- 2010

The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, most of these studies consider cooperative cost sharing games in an offline setting, i.e., the mechanism knows all players and their respective input data in advance. In this paper,… (More)

- Janina A. Brenner, Sándor P. Fekete, Jan van der Veen
- Math. Meth. of OR
- 2009

We consider a special case of the directed subgraph homeomorphism or topologicalminor problem,where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain… (More)

- Janina A. Brenner, Jan van der Veen, Sándor P. Fekete, Julio A. de Oliveira Filho, Wolfgang Rosenstiel
- 2006 International Conference on Field…
- 2006

We discuss the problem of simultaneously scheduling, binding and routing a given data flow graph to a coarse-grain architecture consisting of identical processing elements (PEs) that are connected by a nearest-neighbour mesh-like interconnection network. While there are heuristics trying to solve this problem, we develop the first exact method based on… (More)

- Janina A. Brenner, Sándor P. Fekete, Jan van der Veen
- Electronic Notes in Discrete Mathematics
- 2006

- ‹
- 1
- ›