We identify the complete class of transfer rules that guarantee strategyproofness of any non-increasing in completion time allocation rule for the sequencing problem. We then characterize the class of mechanisms satisfying efficiency of decision (or aggregate cost minimization), egalitarian...

Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

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...

The present paper provides three different support results for the Nash bargaining solution of $n$-person bargaining games. First, for any bargaining game there is defined a non-cooperative game in strategic form, whose unique Nash equilibrium induces a payoff vector that coincides with the Nash...

Studying one-input one-output economies, we say that an allocation is proportional if the input-output ratio is identical among agents and if each agent maximizes her welfare given this ratio. We propose three equity axioms based on this definition, and we use them to compare the main solutions...

We consider estate division problems, a generalization of bankruptcy problems. We show that in a direct revelation claim game, if the underlying division rule satisfies efficiency, equal treatment of equals, and weak order preservation, then all (pure strategy) Nash equilibria induce equal...

In a moneyless market, a non storable, non transferable homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary...

A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...

Different evaluators typically disagree how to rank different candidates since they care more or less for the various qualities of the candidates. It is assumed that all evaluators submit vector bids assigning a monetary bid for each possible rank order. The rules must specify for all possible...

We investigate the implications of welfare lower bounds together with queue-efficiency and strategyproofness in the context of the queueing problem. As a consequence, we provide alternative characterizations of the k-pivotal mechanisms (Mitra and Mutuswami [13]). First, we introduce the...