Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

The theory of stable allocations and the practice of market design. The Nobel Prize in Economics 2012 for Alvin E. Roth and Lloyd S. Shapley

  • Massó, Jordi|||0000-0003-3712-0041
The Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel 2012 was awarded jointly to Alvin E. Roth and Lloyd S. Shapley for their contributions to the theory of stable allocations and the practice of market design. The theory of stable allocations consists of a family of models that study assignment problems in which two disjoint sets of agents (or a set of agents and a set of objects) have to be matched. For example, men to women, workers to firms, students to schools, or patients to live donor kidneys. A matching is stable if no subset of agents can improved upon their proposed matches by rematching only among themselves. Stability is an essential property if matching is voluntary. The practice of market design consists of applying those two-sided matching models to specific assignment problems with the aim of proposing improvements on how they are solved. This paper presents a brief description of the academic career of the laureates and describes their contributions by presenting the most basic two-sided matching model and some of its market design applications, including the organization of a centralized system to propose kidney transplantations to use kidneys of live donors that are incompatible with their respective patients, the yearly assignment of North-American medical students to hospital internship programs, and children to schools in cities such as Boston and New York. [Contrib Sci 11(1): 103-112 (2015)]
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Stable Partitions in Many Division Problems, The Proportional and the Sequential Dictator Solutions

  • Bergantiños, Gustavo|||0000-0003-2592-5213
  • Massó, Jordi|||0000-0003-3712-0041
  • Moreno de Barreda, Inés|||0009-0007-2968-8143
  • Neme, Alejandro
We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists of a partition function and a solution. Given a preference profile, a partition is selected and as many units of the good as the number of coalitions in the partition are allocated, where each unit is shared among all agents belonging to the same coalition according to the solution. A rule is stable at a preference profile if no agent strictly prefers to leave his coalition to join another coalition and all members of the receiving coalition want to admit him. We show that the proportional solution and all sequential dictator solutions admit stable partition functions. We also show that stability is a strong requirement that becomes easily incompatible with other desirable properties like efficiency, strategy-proofness, anonymity, and non-envyness.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Comparing generalized median voter schemes according to their manipulability

  • Arribillaga, R. Pablo|||0000-0002-0521-0301
  • Massó, Jordi|||0000-0003-3712-0041
We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions are stated using the two associated families of monotonic fixed ballots and depend very much on the power each agent has to unilaterally change the outcomes of the two generalized median voter schemes. We perform a specific analysis of all median voter schemes, the anonymous subfamily of generalized median voter schemes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo preliminar (WorkingPaper)

On strategy-proofness and the salience of single-peakedness

  • Chatterji, Shurojit
  • Massó, Jordi|||0000-0003-3712-0041
We consider strategy-proof social choice functions operating on a rich domain of preference pro les. We show that if the social choice function satis es in addition tops-onlyness, anonymity and unanimity then the preferences in the domain have to satisfy a variant of single-peakedness (referred to as semilattice single-peakedness). We do so by deriving from the social choice function an endogenous partial order (a semilattice) from which the notion of a semilattice single-peaked preference can be de ned. We also provide a converse of this main nding. Finally, we show how well-known restricted domains under which nontrivial strategy-proof social choice functions are admissible are semilattice single-peaked domains.
Dipòsit Digital de Documents de la UAB
Publicación Artículo preliminar (WorkingPaper)

Comparing generalized median voter schemes according to their manipulability

  • Arribillaga, R. Pablo|||0000-0002-0521-0301
  • Massó, Jordi|||0000-0003-3712-0041
We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions are stated using the two associated families of monotonic fixed ballots and depend very much on the power each agent has to unilaterally change the outcomes of the two generalized median voter schemes. We perform a specific analysis of all median voter schemes: the anonymous subfamily of generalized median voter schemes.