In two-sided matching problem, there are overwhelming evidences that support peoples are also motivated by concerns for fairness and reciprocity. We will show that compromise which is individually irrational improves the welfare of the whole groups. The reasonable compromise level is obtained as the function of the size of the group so that the social utility should be maximized
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
People like to help those who are helping them and to hurt those who are hurting them. Outcomes reje...
We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched...
In this paper, we propose a new algorithm for two-sided matching problems with some compromise. We d...
We consider the problem of matching one kind of agent with another, e.g. marriageable men and women,...
Gale and Shapley originally proposed the two-sided matching algorithm, Deferred Acceptance Algorithm...
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise...
Abstract. We consider the loss in social welfare caused by individual rationality in matching scenar...
In two-sided matching problems, we formulate (i) a concept of equity of matchings based on envy mini...
In two-sided matching problems, we formulate (i) a concept of eq-uity of matchings based on envy min...
In two-sided matching problems, we formulate (i) a concept of eq-uity of matchings based on envy min...
We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched...
Institutions often utilize matching rules to facilitate the achievement of cooperative outcomes. Yet...
We consider bilateral matching problems where each person views those on the other side of the marke...
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwis...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
People like to help those who are helping them and to hurt those who are hurting them. Outcomes reje...
We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched...
In this paper, we propose a new algorithm for two-sided matching problems with some compromise. We d...
We consider the problem of matching one kind of agent with another, e.g. marriageable men and women,...
Gale and Shapley originally proposed the two-sided matching algorithm, Deferred Acceptance Algorithm...
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise...
Abstract. We consider the loss in social welfare caused by individual rationality in matching scenar...
In two-sided matching problems, we formulate (i) a concept of equity of matchings based on envy mini...
In two-sided matching problems, we formulate (i) a concept of eq-uity of matchings based on envy min...
In two-sided matching problems, we formulate (i) a concept of eq-uity of matchings based on envy min...
We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched...
Institutions often utilize matching rules to facilitate the achievement of cooperative outcomes. Yet...
We consider bilateral matching problems where each person views those on the other side of the marke...
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwis...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
People like to help those who are helping them and to hurt those who are hurting them. Outcomes reje...
We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched...