Can Alpha–Beta be used on symmetric zero sum games? This question was asked in an AI exam. How would you answer such question?
If the game is not sequential, there would be no game tree and no need for pruning.  Alpha-beta is a technique applied to look-ahead search.  Alpha-beta has demonstrated utility in algorithms that play combinatorial games. 

(Even in iterated dilemmas, it doesn't really branch because it's simultaneous, more of a vine than a tree.  Decisionmaking would be based on mathematical analysis of the payoff matrix and statistical analysis of competitor behavior over time.)