Showing 1 - 10 of 1,266
This paper revisits a particular norm of behaviour underlying the well known model of kinked demand. We show that under some standard regularity conditions this norm of behaviour sustains the efficient outcome in all symmetric games.
Persistent link: https://www.econbiz.de/10015257001
An allocation of indivisible items among n ≥ 2 players is proportional if and only if each player receives a proportional subset—one that it thinks is worth at least 1/n of the total value of all the items. We show that a proportional allocation exists if and only if there is an allocation...
Persistent link: https://www.econbiz.de/10015242896
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner can identify the agents that merge. Under this new framework, and as opposed to the traditional model, there exist rules that satisfy merge-proofness. Besides, by strengthening this property and...
Persistent link: https://www.econbiz.de/10015246750
The purpose of this master thesis is to have in a simple and detailed way the significant results of social choice theory and to study the resource sharing (goods or responsibilities) between petitioning agents in a proof of election. While analyzing social choice functions more insight, we...
Persistent link: https://www.econbiz.de/10015247891
Suppose two players wish to divide a finite set of indivisible items, over which each distributes a specified number of points. Assuming the utility of a player’s bundle is the sum of the points it assigns to the items it contains, we analyze what divisions are fair. We show that if there is...
Persistent link: https://www.econbiz.de/10015252488
We model sequencing problems as coalitional games and study the Shapley value and the non-emptiness of the core. The ”optimistic” cost of a coalition is its minimum waiting cost when the members are served first in an order. The ”pessimistic” cost of a coalition is its minimum waiting...
Persistent link: https://www.econbiz.de/10015213133
A polluted river network is populated with agents (e.g., firms, villages, municipalities, or countries) located upstream and downstream. This river network must be cleaned, the costs of which must be shared among the agents. We model this problem as a cost sharing problem on a tree network....
Persistent link: https://www.econbiz.de/10015232082
Regional imbalance of doctors is a serious issue in many countries. In an attempt to average the geographical distribution of doctors, the Japanese government introduced ``regional caps'' recently, restricting the total number of medical residents matched within each region. Motivated by this...
Persistent link: https://www.econbiz.de/10015240914
In this paper, we consider two-sided, many-to-one matching problems where agents in one side of the market (hospitals) impose some distributional constraints (e.g., a minimum quota for each hospital). We show that when the preference of the hospitals is represented as an M-natural-concave...
Persistent link: https://www.econbiz.de/10015242691
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node. We show that the sharing rule that assigns to each agent his own connection...
Persistent link: https://www.econbiz.de/10015245108