A Note on Viable Proposals*

Sengupta and Sengupta (“Viable Proposals,”International Economic Review 35 (1994), 347–59.) consider a payoff vector of a TU‐game as a viable proposal if it challenges each legitimate contender. They show that for each game the set of viable proposals is nonempty. Their proof, however, has a flaw. I present a proof based upon a result by Kalai and Schmeidler (“An Admissible Set Occurring in Various Bargaining Situations,”Journal of Economic Theory 14 (1977), 402–11) .