Showing 1 - 10 of 11
Domains of individual preferences for which the well-known impossibility Theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. First, we introduce necessary and sufficient conditions for a domain to admit non-dictatorial, Pareto efficient and either strategy-proof...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010316073
We consider voting rules on a multidimensional policy space for a continuum of voters with elliptic preferences. Assuming continuity, gamma -strategy-proofnessmeaning that coalitions of size smaller or equal to a small number gamma cannot manipulateand unanimity, we show that such rules are...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010317111
Matchings in a market may have varying degrees of compromise from efficiency, fairness, and or stability. A distance function allows to quantify such concepts or the (dis)similarity between any two matchings. There are a few attempts to propose such functions, however these are tailored for...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10014537003
This paper constructs a normative framework to quantify the difference (distance) between outcomes of market mechanisms in matching markets. We investigate the "cost of transformation" from one market mechanism to another, based on the differences in the outputs of these mechanisms, i.e., the...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10012270853
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a 'dualize and restrict' procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010272559
A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of such networks are exchange networks, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative transferable...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010325263
This note provides a methodological contribution to the allocation of joint revenues obtained from passepartouts. In a passepartout system a group of service providers offers a passepartout that allows its owners the use of specified services for an unlimited number of times during a fixed...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010325856
This paper extends the notion of individual minimal rights for a transferable utility game (TU-game) to coalitional minimal rights using minimal balanced families of a specific type, thus defining a corresponding minimal rights game. It is shown that the core of a TU-game coincides with the core...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010326133
In this paper, we analyze bankruptcy problems with nontransferable utility (NTU) from a game theoretical perspective by redefining corresponding NTU-bankruptcy games in a tailor-made way. It is shown that NTU-bankruptcy games are both coalitional merge convex and ordinal convex. Generalizing the...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010377244
In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by monetary reward functions. We characterize Pareto optimal matchings by means of contractually exchange stability and matchings of maximum total reward by means of compensation...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010491315