DOIAbstract
This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexit
This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexit
The stable matching problem (also known as the stable marriage problem) is a well-known problem of m...
We present new integer linear programming (ILP) models for N P-hard optimisation problems in instanc...
This thesis focuses on matching under ordinal preferences, i.e. problems where agents may be require...
This special issue of Algorithms is devoted to the study of matching problems involving ordinal pref...
Matching theory studies how agents and/or objects from different sets can be matched with each other...
Matching under preferences involves matching agents to one another, subject to various optimality cr...
We study a generalization of the classical stable matching problem that allows for cardinal preferen...
This thesis is a study of a number of matching problems that seek to match together pairs or groups ...
This paper studies matching markets where institutions are matched with possibly more than one indiv...
We study many-to-one matching problems between institutions and individuals where an institution can...
Matching problems involve a set of participants, where each participant has a capacity and a subset ...
Consider the bipartite matching problem with two sets of participants: men (L) and women (R). Each p...
When ties and incomplete preference lists are permitted in the stable marriage and hospitals/residen...
When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residen...
Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matchin...
The stable matching problem (also known as the stable marriage problem) is a well-known problem of m...
We present new integer linear programming (ILP) models for N P-hard optimisation problems in instanc...
This thesis focuses on matching under ordinal preferences, i.e. problems where agents may be require...
This special issue of Algorithms is devoted to the study of matching problems involving ordinal pref...
Matching theory studies how agents and/or objects from different sets can be matched with each other...
Matching under preferences involves matching agents to one another, subject to various optimality cr...
We study a generalization of the classical stable matching problem that allows for cardinal preferen...
This thesis is a study of a number of matching problems that seek to match together pairs or groups ...
This paper studies matching markets where institutions are matched with possibly more than one indiv...
We study many-to-one matching problems between institutions and individuals where an institution can...
Matching problems involve a set of participants, where each participant has a capacity and a subset ...
Consider the bipartite matching problem with two sets of participants: men (L) and women (R). Each p...
When ties and incomplete preference lists are permitted in the stable marriage and hospitals/residen...
When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residen...
Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matchin...
The stable matching problem (also known as the stable marriage problem) is a well-known problem of m...
We present new integer linear programming (ILP) models for N P-hard optimisation problems in instanc...
This thesis focuses on matching under ordinal preferences, i.e. problems where agents may be require...
Add to ORKG