Pàgina inicial > Resultats de la cerca: Matching Stability
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 10 registres trobats en 0.02 segons.
Articles, 8 registres trobats
Documents de recerca, 2 registres trobats
Articles 8 registres trobats  
1.
32 p, 511.3 KB Constrained-optimal tradewise-stable outcomes in the one-sided assignment game : a solution concept weaker than the core / Pérez-Castrillo, David (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Sotomayor, Marilda (Universidade de São Paulo)
In the one-sided assignment game, any two agents can form a trade; they can decide to form a partnership and agree on how to share the surplus created. Contrary to the two-sided assignment game, stable outcomes often fail to exist in the one-sided assignment game. [...]
2023 - 10.1007/s00199-022-01483-9
Economic theory, 6 January (2023)  
Registre complet - Creative Commons
2.
35 p, 428.9 KB Matching Markets under (In)complete Information / Ehlers, Lars (Université de Montréal) ; Massó, Jordi (Universitat Autònoma de Barcelona)
We introduce incomplete information to centralized many-to-one matching markets. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most entry-level matching is many-to-one (and not one-to-one). [...]
2015 - 10.1016/j.jet.2015.01.008
Journal of economic theory, Vol. 157 (2015) , p. 295-314  
Registre complet -
3.
44 p, 312.1 KB An algorithm to compute the full set of many-to-many stable matchings / Martínez, Ruth (Universidad Nacional de San Luis (Argentina)) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Neme, Alejandro (Universidad Nacional de San Luis (Argentina)) ; Oviedo, Jorge (Universidad Nacional de San Luis (Argentina))
The paper proposes an algorithm to compute the full set of many-to-many stable matchings when agents have substitutable preferences. The algorithm starts by calculating the two optimal stable matchings using the deferred-acceptance algorithm. [...]
2004 - 10.1016/j.mathsocsci.2003.07.002
Mathematical social sciences, Vol. 47 Núm. 2 (March 2004) , p. 187-210  
Registre complet -
4.
27 p, 257.0 KB The Blocking Lemma for a many-to-one maching model / Martínez, Ruth (Universidad Nacional de San Luis (Argentina)) ; Neme, Alejandro (Universidad Nacional de San Luis (Argentina)) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Oviedo, Jorge (Universidad Nacional de San Luis (Argentina))
The Blocking Lemma identifies a particular blocking pair for each non-stable and individually rational matching that is preferred by some agents of one side of the market to their optimal stable matching. [...]
2010 - 10.1016/j.jmateco.2010.08.010
Journal of mathematical economics, Vol. 46 Núm. 5 (September 2010) , p. 937-949  
Registre complet -
5.
29 p, 245.3 KB On the invariance of the set of stable matchings with respect to substitutable preference profiles / Martínez, Ruth (Universidad Nacional de San Luis (Argentina))) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Neme, Alejandro (Universidad Nacional de San Luis (Argentina))) ; Oviedo, Jorge (Universidad Nacional de San Luis (Argentina)))
For the many-to-one matching model we give a procedure to partition the set of substitutable preference profiles into equivalence classes with the property that all profiles in the same class have the same set of stable matchings. [...]
2007 - 10.1007/s00182-007-0080-7
International journal of game theory, Vol. 36 Núm. 3 (October 2007) , p. 497-518  
Registre complet -
6.
19 p, 282.5 KB On group strategy-proof mechanisms for a many-to-one maching model / Martínez, Ruth (Universidad Nacional de San Luis (Argentina))) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Neme, Alejandro (Universidad Nacional de San Luis (Argentina))) ; Oviedo, Jorge (Universidad Nacional de San Luis (Argentina)))
For the many-to-one matching model in which firms have substitutable and quota q−separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. [...]
2004 - 10.1007/s001820400189
International journal of game theory, Vol. 33 Núm. 1 (Decemberq 2004) , p. 115-128  
Registre complet -
7.
13 p, 183.2 KB Weak stability and a bargaining set for the marriage model / Klijn, Flip (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica)
In this note we introduce weak stability, a relaxation of the concept of stability for the marriage model by assuming that the agents are no longer myopic in choosing a blocking pair. The new concept is based on threats within blocking pairs: an individually rational matching is weakly stable if for every blocking pair one of the members can find a more attractive partner with whom he forms another blocking pair for the original matching. [...]
2003 - 10.1016/S0899-8256(02)00534-1
Games and economic behavior, Vol. 42 Núm. 1 (January 2003) , p. 91-100  
Registre complet -
8.
10 p, 260.7 KB Some things couples wanted to know about stable matchings (but were afraid to ask) / Klaus, Bettina (Maastricht University. Department of Economics) ; Klijn, Flip (Institut d'Anàlisi Econòmica) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica)
In this note we study the National Resident Matching Program (NRMP) algorithm in the US market for physicians. We report on two problems that concern the presence of couples, a feature explicitly incorporated in the new NRMP algorithm (cf. [...]
2007 - 10.1007/s10058-006-0017-9
Review of economic design, Núm. 11 (2007) , p. 175-184  
Registre complet -

Documents de recerca 2 registres trobats  
1.
24 p, 524.5 KB Robust design in monotonic matching markets : a case for firm-proposing deferred-acceptance / Ehlers, Lars (Université de Montréal) ; Massó, Jordi (Universitat Autònoma de Barcelona)
We study two-sided matching markets among workers and firms. Workers seek one position at a firm but firms may employ several workers. In many applications those markets are monotonic: leaving positions unfilled is costly as for instance, for hospitals this means not being able to provide full service to its patients. [...]
Centre interuniversitaire de recherche en économie quantitative (CIREQ) 2018 (Cahiers de recherche ; 04-2018)  
Registre complet -
2.
10 p, 245.8 KB Some things couples always wanted to know about stable matchings (but were afraid to ask) / Klaus, Bettina (Maastricht University. Department of Economics) ; Klijn, Flip (Institut d'Anàlisi Econòmica) ; Massó, Jordi (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Centre de Referència en Economia Analítica.
In this note we study the National Resident Matching Program (NRMP) algorithm in the US market for physicians. We report on two problems that concern the presence of couples, a feature explicitly incorporated in the new NRMP algorithm (cf. [...]
Centre de Referencia en Economia Analítica, 2005 (Barcelona economics working papers series; 78)  
Registre complet -

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.
Dipòsit Digital de Documents de la UAB :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem