DOIAbstract
This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity
This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity
In this paper we apply the instrumental approach to social preferences in order to distinguish among...
We consider centralized matching markets in which, starting from an arbitrary match¬ing, firms are s...
Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matchin...
This special issue of Algorithms is devoted to the study of matching problems involving ordinal pre...
Matching under preferences involves matching agents to one another, subject to various optimality cr...
We are very grateful to Flip Klijn, an anonymous referee and an associate editor for their helpful c...
We consider bilateral matching problems where each person views those on the other side of the marke...
In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences ove...
This paper introduces the concept of ordient for binary relations (preferences), a relative of the c...
Consider the bipartite matching problem with two sets of participants: men (L) and women (R). Each p...
We study the problem of matching a set of applicants to a set of posts, where each applicant has an ...
The secretary problem is a classic model for online decision making. Recently, combinatorial extensi...
In this paper we apply the instrumental approach to social preferences in order to distinguish amon...
The allocation of resources between providers to consumers is a well-known problem and has received ...
We propose a constraint programming approach to the popular matching problem. We show that one can u...
In this paper we apply the instrumental approach to social preferences in order to distinguish among...
We consider centralized matching markets in which, starting from an arbitrary match¬ing, firms are s...
Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matchin...
This special issue of Algorithms is devoted to the study of matching problems involving ordinal pre...
Matching under preferences involves matching agents to one another, subject to various optimality cr...
We are very grateful to Flip Klijn, an anonymous referee and an associate editor for their helpful c...
We consider bilateral matching problems where each person views those on the other side of the marke...
In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences ove...
This paper introduces the concept of ordient for binary relations (preferences), a relative of the c...
Consider the bipartite matching problem with two sets of participants: men (L) and women (R). Each p...
We study the problem of matching a set of applicants to a set of posts, where each applicant has an ...
The secretary problem is a classic model for online decision making. Recently, combinatorial extensi...
In this paper we apply the instrumental approach to social preferences in order to distinguish amon...
The allocation of resources between providers to consumers is a well-known problem and has received ...
We propose a constraint programming approach to the popular matching problem. We show that one can u...
In this paper we apply the instrumental approach to social preferences in order to distinguish among...
We consider centralized matching markets in which, starting from an arbitrary match¬ing, firms are s...
Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matchin...
Add to ORKG