Showing 1 - 10 of 10
Persistent link: https://www.econbiz.de/10009632538
Persistent link: https://www.econbiz.de/10010375478
Persistent link: https://www.econbiz.de/10010412360
We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other....
Persistent link: https://www.econbiz.de/10010547276
We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other....
Persistent link: https://www.econbiz.de/10010828267
Consider a problem in which the cost of building an irrigation canal has to be divided among a set of people. Each person has different needs. When the needs of two or more people overlap, there is congestion. In problems without congestion, a unique canal serves all the people and it is enough...
Persistent link: https://www.econbiz.de/10010763922
We study situations of allocating positions or jobs to students or workers based on priorities. An example is the assignment of medical students to hospital residencies on the basis of one or several entrance exams. For markets without couples, e.g., for ``undergraduate student placement,''...
Persistent link: https://www.econbiz.de/10005582634
We consider one-to-one matching (roommate) problems in which agents (students) can either be matched as pairs or remain single. The aim of this paper is twofold. First, we review a key result for roommate problems (the ``lonely wolf'' theorem) for which we provide a concise and elementary proof....
Persistent link: https://www.econbiz.de/10005582679
We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched as pairs or remain single. We introduce a so-called bi-choice graph for each pair of stable matchings and characterize its structure. Exploiting this structure we obtain as a corollary the "lone...
Persistent link: https://www.econbiz.de/10005754964
We consider one-to-one matching (roommate) problems in which agents (students) can either be matched as pairs or remain single. The aim of this paper is twofold. First, we review a key result for roommate problems (the "lonely wolf" theorem) for which we provide a concise and elementary proof....
Persistent link: https://www.econbiz.de/10010547371