Sciweavers

31 search results - page 1 / 7
» On Computing Pareto Stable Assignments
Sort
View
STACS
2012
Springer
12 years 2 days ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 4 months ago
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
Haris Aziz, Felix Brandt, Hans Georg Seedig
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 4 months ago
Stable partitions in additively separable hedonic games
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...
Haris Aziz, Felix Brandt, Hans Georg Seedig
IWPEC
2009
Springer
13 years 11 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
Dániel Marx, Ildikó Schlotter
ICYCS
2008
IEEE
13 years 11 months ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen