Skip to main content

Resultados relacionados

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

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

The chi-compromise value for non-transferable utility games

  • Bergantiños, Gustavo|||0000-0003-2592-5213
  • Massó, Jordi|||0000-0003-3712-0041
We introduce a compromise value for non-transferable utility games: the Chi-compromise value. It is closely related to the Compromise value introduced by Borm, Keiding, McLean, Oortwijn, and Tijs (1992), to the MC-value introduced by Otten, Borm, Peleg, and Tijs (1998), and to the Ω-value introduced by Bergantiños, Casas- Méndez, and Vázquez-Brage (2000). The main difference being that the maximal aspiration a player may have in the game is his maximal (among all coalitions) marginal contribution. We show that it is well defined on the class of totally essential and non-level games. We propose an extensive-form game whose subgame perfect Nash equilibrium payoffs coincide with the Chi-compromise value
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On the lattice structure of the set of stable matchings for a many-to-one model

  • Martínez, Ruth
  • Massó, Jordi|||0000-0003-3712-0041
  • Neme, Alejandro
  • Oviedo, Jorge
For the many-to-one matching model with firms having substitutable and q-separable preferences we propose two very natural binary operations that together with the unanimous partial ordering of the workers endow the set of stable matchings with a lattice structure. We also exhibit examples in which, under this restricted domain of firms' preferences, the classical binary operations may not even be matching
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Maximal domain of preferences for the division problem

  • Massó, Jordi|||0000-0003-3712-0041
  • Neme, Alejandro
The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, then the uniform allocation rule is the unique strategy-proof, efficient, and anonymous rule. We identify the maximal set of preferences, containing the set of single-peaked preferences, under which there exists at least one rule satisfying the properties of strategy-proofness, efficiency, and strong symmetry. In addition, we show that our characterization implies a slightly weaker version of Ching and Serizawa's (1998) result. Journal of Economic Literature Classification Numbers: D71, D78, D63.
Dipòsit Digital de Documents de la UAB
Publication Artículo preliminar (WorkingPaper)

A theorem on preference aggregation

  • Barberà, Salvador|||0000-0001-6586-2398
I present a general theorem on preference aggregation. This theorem implies, as corollaries, Arrow's Impossibility Theorem, Wilson's extension of Arrow's to non-Paretian aggregation rules, the Gibbard-Satterthwaite Theorem and Sen's result on the Impossibility of a Paretian Liberal. The theorem shows that these classical results are not only similar, but actually share a common root. The theorem expresses a simple but deep fact that transcends each of its particular applications: it expresses the tension between decentralizing the choice of aggregate into partial choices based on preferences over pairs of alternatives, and the need for some coordination in these decisions, so as to avoid contradictory recommendations.
Dipòsit Digital de Documents de la UAB
Publication Artículo preliminar (WorkingPaper)

Preference for flexibility and the opportunities of choice

  • Barberà, Salvador|||0000-0001-6586-2398
  • Grodal, Birgit
A decision-maker exhibits preference for flexibility if he always prefers any set of alternatives to its subsets, even when two of them contain the same best element. Desire for flexibility can be explained as the consequence of the agent's uncertainty along a two-stage process, where he must first preselect a subset of alternatives from which to make a final choice later on. We investigate conditions on the rankings of subsets that are compatible with the following assumptions: (1) the agent is endowed with a VN-M utility function on alternatives, (2) the agent attaches a subjective probability to the survival of each subset of alternatives, and (3) the agent will make a best choice out of any set which becomes available, and ranks sets ex-ante in terms of the expected utility of the best surviving alternatives within them.