Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > W. KERN:
All reports by Author W. Kern:

TR95-016 | 2nd February 1995
U. Faigle, S.P. Fekete, W. Hochstättler, W. Kern

On approximately fair cost allocation in Euclidean TSP games

We consider the problem of fair cost allocation for traveling
salesman games for which the triangle inequality holds. We
give examples showing that the core of such games may be
empty, even for the case of Euclidean distances. On the
positive side, we develop an LP-based ... more >>>


TR95-014 | 27th January 1995
U. Faigle, W. Kern, M. Streng

Note On the Computational Complexity of $j$-Radii of Polytopes in ${\Re}^n$

We show that, for fixed dimension $n$, the approximation of
inner and outer $j$-radii of polytopes in ${\Re}^n$, endowed
with the Euclidean norm, is polynomial.

more >>>

TR95-007 | 1st January 1995
U. Faigle, S.P. Fekete, W. Hochstättler, W. Kern

THE NUCLEON OF COOPERATIVE GAMES AND AN ALGORITHM FOR MATCHING GAMES

The {\it nucleon} is introduced as a new allocation concept for
non-negative cooperative n-person transferable utility games.
The nucleon may be viewed as the multiplicative analogue of
Schmeidler's nucleolus.
It is shown that the nucleon of (not necessarily bipartite) matching
games ... more >>>




ISSN 1433-8092 | Imprint