scientific article
From MaRDI portal
Publication:3604325
zbMath1154.91579MaRDI QIDQ3604325
Katarína Cechlárova, Viera Borbel'ová
Publication date: 24 February 2009
Full work available at URL: http://www.kybernetika.cz/content/2008/3/373
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) (n)-person games, (n>2) (91A06) Matching models (91B68)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairwise kidney exchange
- Residence exchange wanted: A stable residence exchange problem
- On the complexity of testing membership in the core of min-cost spanning tree games
- Stability in coalition formation games
- On computational complexity of membership test in flow games and linear production games
- Computational complexity of stable partitions with b-preferences
- The kidney exchange problem: how hard is it to find a donor?
- The cycle roommates problem: a hard case of kidney exchange
- Optimal Control of a Paired-Kidney Exchange Program
- Minimum cost spanning tree games
- Totally Balanced Games and Games of Flow
- On the core of linear production games
- Algorithms and Computation
This page was built for publication:
