Filters








145,945 Hits in 9.0 sec

Stability and Optimality in Matching Problems with Weighted Preferences [chapter]

Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh
2013 Communications in Computer and Information Science  
In this context, we define new notions of stability and optimality, and we provide algorithms to find marriages which are stable and/or optimal according to these notions.  ...  Here we consider stable marriage problems with weighted preferences: each man (resp., woman) provides a score for each woman (resp., man).  ...  Acknowledgments This work has been partially supported by the MIUR PRIN 20089M932N project "Innovative and multi-disciplinary approaches for constraint and preference reasoning".  ... 
doi:10.1007/978-3-642-29966-7_21 fatcat:y4rig734ozd4bile536groorwq

Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences

Maria Pini, Francesca Rossi, K. Venable, Toby Walsh
2013 Algorithms  
In this context, we define new notions of stability and optimality, and we provide algorithms to find marriages that are stable and/or optimal according to these notions.  ...  Here, we consider stable marriage problems with weighted preferences: each man (resp., woman) provides a score for each woman (resp., man).  ...  This work has been partially supported by the MIURPRIN20089M932N project "Innovative and multi-disciplinary approaches for constraint and preference reasoning".  ... 
doi:10.3390/a6040782 fatcat:etsjlbyrxvg75duukdvxfqboou

Internally Stable Matchings and Exchanges

Yicheng Liu, Pingzhong Tang, Wenyi Fang
2014 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Stability is a central concept in exchange-based mechanismdesign.  ...  Our contribu-tions are as follows: for both pairwise matchings and limited-length exchanges, for both unweighted and weighted graph-s, (1) we prove desirable tight social welfare bounds; (2) weanalyze  ...  In other words, optimal welfare with stability constraints is arbitrarily far from the unconstrained optimal. For the other, imposition of stability incurs computational cost.  ... 
doi:10.1609/aaai.v28i1.8883 fatcat:42xlgxj4hrf53cbga73haq5uiq

Abstract argumentation and (optimal) stable marriage problems

Stefano Bistarelli, Francesco Santini
2019 Argument & Computation  
Moreover, we use Weighted Abstract Argumentation to represent optimality criteria in the optimal extension of SM problems, where some matchings are better than others: criteria may consider only the preference  ...  Weighted Abstract Argumentation with C-semirings In this section we rephrase some of the classical definitions in [16] , with the purpose to parametrise them with the notion of weighted attack and c-semiring  ...  Acknowledgements This work has been supported by the following two projects funded by the authors' Department: Argumentation 360 ("Ricerca di Base" 2017-2019) and "Rappresentazione della Conoscenza e Apprendimento  ... 
doi:10.3233/aac-190474 fatcat:cltmtieibzdvviqpblt23oizka

Weights in stable marriage problems increase manipulation opportunities

Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh
2011 Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII  
Stable marriage problems with weighted preferences A stable marriage problem (SM) [3] of size n is the problem of finding a stable matching between n men and n women.  ...  In the classical stable marriage problem, both men and women express a strict preference order over the members of the other sex, in a qualitative way.  ...  Conclusions and future work We have investigated the manipulation properties of stable marriage problems with weighted preferences, and considered two different notions of stability.  ... 
doi:10.1145/2000378.2000402 dblp:conf/tark/PiniRVW11 fatcat:m5czdban7jgfzg2l5kpcg5l7pe

Multi-Scenarios Dynamic Matching Algorithm for Hierarchical Treatment System

Min Zhou
2018 International Journal of Biomedical Engineering and Clinical Science  
To deal with Two-Sided Matching (TSM) problem in hierarchical medical system, a matching decision-making approach based on multiple scenarios was proposed.  ...  This paper concentrated on the stability and total satisfaction goals of system matching.  ...  Munro (2006) [14] proved that even if the matching subject's score and preference order are consistent with stable marriage matching problems, it is still a strong NP-hard problem.  ... 
doi:10.11648/j.ijbecs.20180402.12 fatcat:oyacukjtyraizeuqagvmj7bn5i

Anarchy, stability, and utopia: creating better matchings

Elliot Anshelevich, Sanmay Das, Yonatan Naamad
2011 Autonomous Agents and Multi-Agent Systems  
We give both theoretical and experimental results comparing stable matchings with socially optimal ones, as well as studying the convergence of various natural algorithms to stable matchings.  ...  We analyze some natural distributions of utilities that agents receive from matchings, and find that in most cases the stable matching attains close to the optimal social welfare.  ...  Therefore, the price of stability captures the problem of optimization subject to the stability constraint.  ... 
doi:10.1007/s10458-011-9184-3 fatcat:za72lfsuufgaxkwnzpxnj6e6ty

Anarchy, Stability, and Utopia: Creating Better Matchings [chapter]

Elliot Anshelevich, Sanmay Das, Yonatan Naamad
2009 Lecture Notes in Computer Science  
We give both theoretical and experimental results comparing stable matchings with socially optimal ones, as well as studying the convergence of various natural algorithms to stable matchings.  ...  We analyze some natural distributions of utilities that agents receive from matchings, and find that in most cases the stable matching attains close to the optimal social welfare.  ...  Therefore, the price of stability captures the problem of optimization subject to the stability constraint.  ... 
doi:10.1007/978-3-642-04645-2_15 fatcat:7s3qs52j75e4dll37rfirkjze4

The Performance and Locality Tradeoff in BitTorrent-Like P2P File-Sharing Systems

W. Huang, C. Wu, F. C. M. Lau
2010 2010 IEEE International Conference on Communications  
b-matching optimization problem.  ...  In particular, we first present a generic maximum weight b-matching model that characterizes the tit-for-tat in BitTorrent-like peer selection.  ...  We prove the maximum weightedness of the achieved stable b-matching, by showing that the matching won't stabilize if there exists a better b-matching resuming larger overall weights (preferences) along  ... 
doi:10.1109/icc.2010.5501746 dblp:conf/icc/HuangWL10 fatcat:7ngeg3xsbbacpafryr5nyj2g6u

Stable Matching for Dynamic Ride-Sharing Systems

Xing Wang, Niels Agatz, Alan Erera
2014 Social Science Research Network  
In this paper we consider a notion of stability for ride-share matches and present several mathematical programming methods to establish stable or nearlystable matches, where we note that ride-share matching  ...  optimization is performed over time with incomplete information.  ...  While the maximum weight stable matching problem with incomplete preference list and ties is generally difficult, we quickly find optimal stable solutions for all our practical instances.  ... 
doi:10.2139/ssrn.2611353 fatcat:r5dahieybjb5tb65xj4jeuqrbu

Stable Matching for Dynamic Ride-Sharing Systems

Xing Wang, Niels Agatz, Alan Erera
2018 Transportation Science  
In this paper we consider a notion of stability for ride-share matches and present several mathematical programming methods to establish stable or nearlystable matches, where we note that ride-share matching  ...  optimization is performed over time with incomplete information.  ...  While the maximum weight stable matching problem with incomplete preference list and ties is generally difficult, we quickly find optimal stable solutions for all our practical instances.  ... 
doi:10.1287/trsc.2017.0768 fatcat:zvfunuvkpff4ldervu6j5cw7ie

Stable marriage problems with quantitative preferences [article]

Maria Silvia Pini and Francesca Rossi and Brent Venable and Toby Walsh
2010 arXiv   pre-print
In this context, we define new notions of stability and optimality, and we provide algorithms to find marriages which are stable and/or optimal according to these notions.  ...  The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other.  ...  Acnowledgements This work has been partially supported by the MIUR PRIN 20089M932N project "Innovative and multi-disciplinary approaches for constraint and preference reasoning".  ... 
arXiv:1007.5120v1 fatcat:odkbk7r7fvarpkeelxrch7tshy

Stable Fractional Matchings [article]

Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish
2020 arXiv   pre-print
We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral).  ...  We present simple approximation algorithms for this problem with weak welfare guarantees and, rather unexpectedly, we furthermore show that achieving better approximations is hard.  ...  Rohit Vaish acknowledges support from ONR#N00014-17-1-2621 while he was affiliated with Rensselaer Polytechnic Institute, and is currently supported by project no.  ... 
arXiv:1902.06698v2 fatcat:fodx5zag4fa6xe2bnq4sszemxy

New approach for a stable multi-criteria ridesharing system [article]

Sawsen Ben Nasr
2019 arXiv   pre-print
sharing a private space with others and (ii) enables a stable matching between driver and passenger sets.  ...  The witnessed boom in mobility results in many problems such as urbanization, costly construction of many highways and air pollution.  ...  For that, in our approach we associate the problem of stable marriage with the notion of stability in the matching problem but we rely on stable marriage assignment for unequal sets presented in [63]  ... 
arXiv:1901.02510v2 fatcat:7g6ks3zjuvbfjkasmgegkdlcji

An Introduction to Optimal Stable Marriage Problems and Argumentation Frameworks

Stefano Bistarelli, Francesco Santini
2019 International Conference of the Italian Association for Artificial Intelligence  
In this paper we elaborate on the original formulation by using Weighted Abstract Argumentation to also represent optimality criteria in Optimal SM problems, where some matchings are better than others  ...  In the Stable Marriage (SM) problem, given two sets of individuals partitioned into men and women, a matching is stable when there does not exist any matching man-woman by which both man and woman would  ...  Preference on Arguments In this section we model the three optimality criteria in Sect. 2 by labelling arguments with weights as performed in [1] .  ... 
dblp:conf/aiia/BistarelliS19 fatcat:7b4kbq4y2bdvpfnafqkpjkmeiu
« Previous Showing results 1 — 15 out of 145,945 results