Stable matching problems with soft constraints
نویسندگان
چکیده
We consider stable matching problems where the agents express their preferences compactly via soft constraints. We study the impact of this choice on the computational complexity of finding stable matching, with particular attention to fuzzy constraints.
منابع مشابه
Soft Constraints in Stable Matching Problems
The stable matching problem has many practical applications in two-sided markets, like those that assign doctors to hospitals, students to schools, or buyers to vendors. Usually it is assumed that the participants of one side explicitly express a preference ordering over all those on the other side. This can be unfeasible when the number of options is large or has a combinatorial structure. We ...
متن کاملSpecialised Constraints for Stable Matching Problems
The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched to each other; in SM men to women, and in HR residents to hospitals. Each set of objects expresses a ranked preference for the objects in the other set, in the form of a preference list. The problem is then to find a matching o...
متن کاملA specialised constraint approach for stable matching problems
Constraint programming is a generalised framework designed to solve combinatorial problems. This framework is made up of a set of predefined independent components and generalised algorithms. This is a very versatile structure which allows for a variety of rich combinatorial problems to be represented and solved relatively easily. Stable matching problems consist of a set of participants wishin...
متن کاملStable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability
In the Stable Marriage and Roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually acceptable agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said to be stable. We investigate the comp...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کامل