Abstract
We study Nash implementation of the bargaining solutions in a cake sharing set up. We argue that the minimal Pareto optimal, symmetric and Nash implementable SBS is the one inducing all Pareto optimal and midpoint-domi- nating utility vectors in each state.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
