We justify the application to extensive games of the concept of ‘fully permissible sets’, which corresponds to 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 dominates the latter on the set of all...

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. 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 dominates the latter on...