Sciweavers

3678 search results - page 3 / 736
» On the Stable Paths Problem
Sort
View
DAM
2007
103views more  DAM 2007»
13 years 5 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott
CORR
2011
Springer
212views Education» more  CORR 2011»
13 years 8 days ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
CONEXT
2005
ACM
13 years 7 months ago
The stability of paths in a dynamic network
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghe...
LCN
2003
IEEE
13 years 11 months ago
Strategies for Finding Stable Paths in Mobile Wireless Ad Hoc Networks
In this paper, we introduce statistical methods to estimate the stability of paths in a mobile wireless ad hoc environment. Identifying stable paths helps to reduce control trafï¬...
Michael Gerharz, Christian de Waal, Peter Martini,...
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
14 years 11 days ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...