Assessing the potential of ride-sharing using mobile and social data: a tale of four cities

B Cici, A Markopoulou, E Frias-Martinez… - Proceedings of the 2014 …, 2014 - dl.acm.org
This paper assesses the potential of ride-sharing for reducing traffic in a city--based on
mobility data extracted from 3G Call Description Records (CDRs), for the cities of Madrid and …

“Almost stable” matchings in the roommates problem

DJ Abraham, P Biró, DF Manlove - International Workshop on …, 2005 - Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable
matching. This motivates the problem of finding a matching that is “as stable as possible”, ie …

[图书][B] Matching theory for wireless networks

Z Han, Y Gu, W Saad - 2017 - Springer
The prevalence of high-performance mobile devices such as smartphones and tablets has
brought fundamental changes to existing wireless networks. The growth of bandwidth …

[HTML][HTML] Complexity of finding Pareto-efficient allocations of highest welfare

P Biró, J Gudmundsson - European Journal of Operational Research, 2021 - Elsevier
We allocate objects to agents as exemplified primarily by school choice. Welfare judgments
of the object-allocating agency are encoded as edge weights in the acceptability graph. The …

Bribery and control in stable marriage

N Boehmer, R Bredereck, K Heeger… - Journal of Artificial …, 2021 - jair.org
We initiate the study of external manipulations in Stable Marriage by considering several
manipulative actions as well as several manipulation goals. For instance, one goal is to …

Geometric stable roommates

EM Arkin, SW Bae, A Efrat, K Okamoto… - Information Processing …, 2009 - Elsevier
We consider instances of the Stable Roommates problem that arise from geometric
representation of participants' preferences: a participant is a point in a metric space, and his …

[图书][B] A study of stable marriage problems with ties

S Scott - 2005 - search.proquest.com
We study a number of variants of the Stable Marriage problem. Such problems have a long
history, but there has been an upsurge in interest in recent years as the various possibilities …

Efficient algorithms for generalized stable marriage and roommates problems

T Fleiner, RW Irving, DF Manlove - Theoretical computer science, 2007 - Elsevier
We consider a generalization of the Stable Roommates problem (sr), in which preference
lists may be partially ordered and forbidden pairs may be present, denoted by srpf. This …

A fine-grained view on stable many-to-one matching problems with lower and upper quotas

N Boehmer, K Heeger - ACM Transactions on Economics and …, 2022 - dl.acm.org
In the NP-hard Hospital Residents problem with lower and upper quotas (HR-QLU), the goal
is to find a stable matching of residents to hospitals where the number of residents matched …

Theory of and experiments on minimally invasive stability preservation in changing two-sided matching markets

N Boehmer, K Heeger, R Niedermeier - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Following up on purely theoretical work, we contribute further theoretical insights into
adapting stable two-sided matchings to change. Moreover, we perform extensive empirical …