This paper studies envy-free allocations for economies with indivisible objects, quasi-linear utility functions, and an amount of money. We give a polynomially bounded algorithm for finding envy-free allocations. Connectedness of envy-graphs, which are used in the algorithm, characterizes the...

We consider two-sided many-to-many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank...

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other....

We consider collective choice problems where a group of agents has to decide on the location of a public facility in a Euclidean space. A well-known solution for such problems is the coordinatewise median of the reported votes and additional fixed ballots. Instead of adding ballots, we extend...

The Muller–Satterthwaite Theorem (J Econ Theory 14:412–418, <CitationRef CitationID="CR13">1977</CitationRef>) establishes the equivalence between Maskin monotonicity and strategy-proofness, two cornerstone conditions for the decentralization of social choice rules. We consider a general model that covers public goods economies as in...</citationref>

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (Games Econ Behav 72:172–186, <CitationRef CitationID="CR8">2011</CitationRef>) introduced two new “population sensitivity” properties...</citationref>