The concept of ‘fully permissible sets ’ is defined by an algorithm that eliminate strategy subset . It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominate the latter on the...