In this paper we present a model of implementation based on the idea that agents renegotiate unfeasible allocations. We characterize the maximal set of Social Choice Correspondences that can be implemented in Nash Equilibrium with a class of renegotiation functions that do not reward agents for...

The paper quantifies the amount of information aggregated by large elections under qualified majority rules. It shows show that, even when the Condorcet Jury Theorem does not hold, there still can be meaningful information aggregation. In particular, we study the case of information aggregation...

We prove that group strategy-proofness and strategy-proofness are equivalent requirements on stable mechanisms in priority-based resource allocation problems with multi-unit demand. The result extends to the model with contracts

In this paper, we present a model of implementation where infea- sible allocations are converted into feasible ones through a process of renego- tiation that is represented by a reversion function. We describe the maximal set of Social Choice Correspondences that can be implemented in Nash Equi-...