Showing 1 - 10 of 1,151
Persistent link: https://www.econbiz.de/10011580788
Persistent link: https://www.econbiz.de/10012108624
A set of outcomes for a TU-game in characteristic function form is dominant if it is, with respect to an outsider-independent dominance relation, accessible (or admissible) and closed. This outsider-independent dominance relation is restrictive in the sense that a deviating coalition cannot...
Persistent link: https://www.econbiz.de/10011591676
Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...
Persistent link: https://www.econbiz.de/10003731672
Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the...
Persistent link: https://www.econbiz.de/10003883281
Ostrovsky [10] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents’ preferences satisfy same side substitutability and cross side complementarity....
Persistent link: https://www.econbiz.de/10003950989
We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...
Persistent link: https://www.econbiz.de/10008780592
This article provides an exact non-cooperative foundation of the sequential Raiffa solution for two person bargaining games. Based on an approximate foundation due to Myerson (1997) for any two-person bargaining game (S,d) an extensive form game G^S^d is defined that has an infinity of weakly...
Persistent link: https://www.econbiz.de/10003944582
Persistent link: https://www.econbiz.de/10009152626
Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? Are some stable matchings more likely to be obtained by this process than others? In...
Persistent link: https://www.econbiz.de/10009229825