We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

This paper reports the results of experiments involving a 3-personcoalitionformation game with an ultimatumbargaining character. The grand coalition was always the efficientcoalition,whereas the values of the 2-personcoalitions are varied such that they lead to an efficiency loss inthe range...

In Becker et al. (2013a,b), we proposed a theory to explain giving behaviour in dictator experiments by a combination of selfishness and a notion of justice. The theory was tested using dictator, social planner, and veil of ignorance experiments. Here we analyse gender differences in preferences...

In Becker et al. (2013a,b), we proposed a theory to explain giving behaviour in dictator experiments by a combination of selfishness and a notion of justice. The theory was tested using dictator, social planner, and veil of ignorance experiments. Here we analyse gender differences in preferences...

This paper reports the results of experiments involving a 3-person coalition formation game with an ultimatum bargaining character. The grand coalition was always the efficient coalition decision, whereas the values of the 2-person coalitions are varied such that they lead to an efficiency loss...

In an experiment on a subjective claims problem we compare three unanimity bargaining procedures - the Demand, the Offer and the Exit variant - in terms of fairness and efficiency. To assess the fairness of the allocations obtained by these procedures, we evaluate them from a partial point of...

In a subjective claims problem several agents have contributed to the production of a cake which is to be divided among them. Since contributions are difficult to compare and the production function is nonlinear, agents'subjective evaluations of claims are likely to be conflicting. In a...

We propose a solution to the trade-off between Pareto efficiency and stability in matching markets. We define a matching to be essentially stable if any claim initiates a chain of reassignments that ultimately results in the initial claimant losing the object she claimed to a third agent. Our...

Many institutions use matching algorithms to allocate resources to individuals. Examples include the assignment of doctors, students and military cadets to hospitals, schools and branches, respectively. Oftentimes, agents' ordinal preferences are highly correlated, motivating the use of...

A group of actors, individuals or firms, can engage in collectively providing projects which may be costly or generating revenues and which may benefit some and harm others. Based on requirements of procedural fairness (Güth and Kliemt, 2013), we derive a bidding mechanism determining...