Faigle U.

U. Faigle

Information about the author U. Faigle will soon be added to the site.
Found 14 papers in total
On the computation of the nucleolus of a cooperative game
On the computation of the nucleolus of a cooperative game
2001
We consider classes of cooperative games. We show that we can efficiently compute an...
Note on the computational complexity of least core concepts for min-costs spanning tree games
Note on the computational complexity of least core concepts for min-costs spanning tree games
2000
Various least core concepts including the classical least core of cooperative games...
On the core of ordered submodular cost games
On the core of ordered submodular cost games
2000
A general ordertheoretic linear programming model for the study of matroid-type greedy...
Computing the nucleolus of min-cost spanning tree games is NP-hard
Computing the nucleolus of min-cost spanning tree games is NP-hard
1998
We prove that computing the nucleolus of minimum cost spanning tree games is in...
Simplices by point-sliding and the Yamnitsky–Levin algorithm
Simplices by point-sliding and the Yamnitsky–Levin algorithm
1997
Yamnitsky and Levin proposed a variant of Khachiyan's ellipsoid method for testing...
On the complexity of testing membership in the core of min-cost-spanning tree games
On the complexity of testing membership in the core of min-cost-spanning tree games
1997
Let N = {1,…, n } be a finite set of players and K N the complete graph on the...
On approximately fair cost allocation in Euclidean TSP games
On approximately fair cost allocation in Euclidean TSP games
1998
We consider the problem of allocating the cost of an optimal traveling salesman tour...
On the communication complexity of t-intersection problems in generalized boolean algebras
On the communication complexity of t-intersection problems in generalized boolean algebras
1996
The authors consider the following game: Two players independently choose a chain in a...
Note on the computational complexity of j-radii of polytopes in ℝ’n.
Note on the computational complexity of j-radii of polytopes in ℝ’n.
1996
The authors show that, for fixed dimension n, the approximation of inner and outer j-...
A random polynomial time algorithm for well-rounding convex bodies
A random polynomial time algorithm for well-rounding convex bodies
1995
The authors present a random polynomial time algorithm for well-rounding convex bodies...
A cutting-plane approach to the edge-weighted maximal clique problem
A cutting-plane approach to the edge-weighted maximal clique problem
1993
The authors investigate the computational performance of a cutting-plane algorithm for...
Some recent results in the analysis of greedy algorithms for assignment problems
Some recent results in the analysis of greedy algorithms for assignment problems
1994
The paper surveys some recent developments in the analysis of greedy algorithms for...
On some approximately balanced combinatorial cooperative games
On some approximately balanced combinatorial cooperative games
1993
A model of taxation for cooperative n- person games is introduced where proper...
Cores of games with restricted cooperation
Cores of games with restricted cooperation
1989
Games with restricted cooperation are cooperative N- person games with sidepayments,...
Papers per page: