We consider the problem of sharing a divisible good, where agents prefer more to less. First, we prove that a sharing rule satisfies strategy proofness if and only if it has the quasi-constancy property: no one changes her own share by changing her announcements. Next, by constructing a system...

We explore the relationships between non-bossiness and Nash implementability. We provide a new domain-richness condition, weak monotonic closedness, and prove that on weakly monotonically closed domains, non-bossiness together with individual monotonicity is equivalent to monotonicity, a...

In this paper, we consider dominant strategy implementation in classical pure exchange economies with free disposal. We show that quasi-strong-non-bossiness and strategy-proofness together are necessary and sufficient for dominant strategy implementation via the direct revelation mechanism....

It is a well-known fact that in some economic environments, non-bossiness and monotonicity are interrelated. In this paper, we have presented a new domain-richness condition called weak monotonic closedness, on which non-bossiness in conjunction with individual monotonicity is equivalent to...

We study dominant strategy implementation especially in economic environments. We first show that in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelationmechanism....

We consider full-truthful Nash implementation, which requires that truth telling by each agent should be a Nash equilibrium of a direct revelation mechanism, and that the set of Nash equilibrium outcomes of the mechanism should coincide with the f -optimal outcome. We show that restricted...

We consider the problem of sharing a good, where agents prefer more to less. In this environment, we prove that a sharing rule satisfies strategy-proofness if and only if it has the quasi-constancy property: no one changes her own share by changing her announcements. Next by constructing a...

We consider the problem of sharing a good, where agents prefer more to less. In this environment, we prove that a sharing rule satisfies strategy-proofness if and only if it has the quasi-constancy property:no one changes her own share by changing her announcements. Next,by constructing a system...

We consider the problem of allocating several units of an indivisible object among the agents with single-peaked and risk-averse utility functions. We introduce equal probability for the best, and show that the randomized uniform rule is the only randomized rule satisfying strategy-proofness,...