From a link that was in the paper mentioned in the previous post, I started to read about RIOT, the MLB simulator at Berkeley. Here is an excerpt from their page:
Calculating the clinching and elimination numbers for the RIOT baseball standings involves systematically searching for scenarios in which particular teams finish with or without gaining playoff berths. For example, we determined that San Francisco was eliminated from first place in the National League West on September 8th by proving that no feasible scenario exists in which the Giants win the division. The problem of determining whether a team can advance to playoffs given the current league standings and schedule of remaining games can be solved by a single maximum flow calculation (see Hoffman and Rivlin  and Schwartz ). By introducing additional constraints, we extend this maximum flow formulation to derive integer linear programming problems which find the minimum number of games a given team must win to clinch a playoff spot or avoid elimination from post season play. Robinson  takes a similar approach to finding a scenario which maximizes a given team’s lead in the final standings. Interested readers should also consult Gusfield and Martel , who show how to find the minimum number of games a team must win to avoid elimination from first place by solving a parametric minimum cut problem.
Very neat. Click here to download their paper.