Abstract
We show the necessary and sufficient conditions for any two of the sets of stable, generalized stable, absorbing or admissible sets of an abstract decision problem to coincide. We show that all these conditions can be written as depending only on the number of predecessors or successors of some alternatives.
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
