In this paper, we present a model of implementation where infeasible allocations are converted into feasible ones through a process of renegotiation that is represented by a reversion function. We describe the maximal set of Social Choice Correspondences that can be implemented in Nash Equilibrium in a class of reversion functions that punish agents for infeasibilities. This is used to study the implementation of the Walrasian Correspondence and several axiomatic solutions to problems of bargaining and taxation.Publicad
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and ...
Abstract. In this paper we investigate the implementation problem arising when some of the players a...
Consider the problem of exact Nash Implementation of social choice correspondences. De\u85ne a lotte...
In this paper, we present a model of implementation where infeasible allocations are converted into...
In this paper, we present a model of implementation where infeasible allocations are converted into ...
In this paper we present a model of implementation based on the idea that agents renegotiate unfeasi...
In this paper we present a model of implementation based on the idea that agents renegotiate unfeasi...
This paper studies Nash implementation when the outcomes of the mechanism can be renegotiated among ...
We examine Nash implementation when individuals cannot be forced to accept the outcome of a mechanis...
We study the problem of implementing social choice correspondences using the concept of undominated ...
We study a mechanism design problem under the assumption that renegotiation cannot be prevented. We ...
A mechanism is said to be renegotiation-proof if it is robust against renegotation both before and a...
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and ...
Abstract. In this paper we investigate the implementation problem arising when some of the players a...
Consider the problem of exact Nash Implementation of social choice correspondences. De\u85ne a lotte...
In this paper, we present a model of implementation where infeasible allocations are converted into...
In this paper, we present a model of implementation where infeasible allocations are converted into ...
In this paper we present a model of implementation based on the idea that agents renegotiate unfeasi...
In this paper we present a model of implementation based on the idea that agents renegotiate unfeasi...
This paper studies Nash implementation when the outcomes of the mechanism can be renegotiated among ...
We examine Nash implementation when individuals cannot be forced to accept the outcome of a mechanis...
We study the problem of implementing social choice correspondences using the concept of undominated ...
We study a mechanism design problem under the assumption that renegotiation cannot be prevented. We ...
A mechanism is said to be renegotiation-proof if it is robust against renegotation both before and a...
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and ...
Abstract. In this paper we investigate the implementation problem arising when some of the players a...
Consider the problem of exact Nash Implementation of social choice correspondences. De\u85ne a lotte...