Browse > Article
http://dx.doi.org/10.7236/JIIBC.2020.20.3.147

Simple Algorithm for Baseball Elimination Problem  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.20, no.3, 2020 , pp. 147-152 More about this Journal
Abstract
The baseball elimination problem(BEP) is eliminates teams that finishes the season in the early stage without play the remaining games because of the team never most wins even though all wins of remaining games. This problem solved by max-flow/min-cut theorem. But the max-flow/min-cut method has a shortcoming of iterative constructs the network for all of team and decides the min-cut for each network. This paper suggests ascending sort in wins game plus remaining games for each team, then the candidate eliminating team set K with lower 1/2 rank and most easy, simple, and fast computes the existence or not of subset R that a team elimination decision. As a result of various experimental data, this algorithm can be find all of elimination teams for whole data with fast and correct.
Keywords
Baseball elimination; Winning game; To plays; Subset R; Candidate eliminating team set K;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. D. Wayne, "A New Property And A Faster Algorithm For Baseball Elimination", SIAM Journal on Discrete Mathematics, Vol. 14, No. 2, pp. 223-229, Sep. 1999, doi:https://doi.org/10.1137/S0895480198348847   DOI
2 B. L. Schwartz, "Possible Winners in Partially Completed Tournaments", SIAM Review, Vol. 8, No. 3, pp. 302-308, Jul. 1966, doi:https://doi.org/10.1137/1008062   DOI
3 A. Hoffman and T. Rivlin, "When is a Team "mathematically" eliminated?", Proceedings of the Princeton Symposium on Mathematical Programming, pp. 391-401, 1967.
4 L. W. Robinson, "Baseball Playoff Eliminations: an Application of Linear Programming", Operations Research Letters, Vol. 10, No. 2, pp. 67-74, Mar. 1991, doi:https://doi.org/10.1016/0167-6377(91)90089-8   DOI
5 C. C. Ribeiro and S. Urrutia, "An Application of Integer Programming to Playoff Elimination in Football Championships", International Transactions in Operational Research, Vol. 12, No. 4, pp. 375-386, Jul. 2005, doi:https://doi.org/10.1111/j.1475-3995.2005.00513.x   DOI
6 W. Kern and D. Paulusma, "The Computational Complexity of the Elimination Problem in Generalized Sports Competitions", Discrete Optimization, Vol. 1, No. 2, pp. 205-214, Nov. 2004, doi:https://doi.org/10.1016/j.disopt.2003.12.003   DOI
7 K. Cechlarova, E. Potpinkova, and I. Schlotter, "Refining the Complexity of the Sports Elimination Problem", Discrete Applied Mathematics, Vol. 199, pp. 172-186, Jan. 2016, doi:https://doi.org/10.1016/j.dam.2015.01.021   DOI
8 D. Gusfield and C. Martel, "A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications", Algorithmica, Vol. 7, No. 1, pp. 499-519, Jun. 1992, doi:https://doi.org/10.1007/F01758775   DOI
9 S. T. McCormick, "Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow", Operations Research, Vol. 45, No. 5, pp. 744-756, May 1999, doi:https://doi.org/0.1287/opre.47.5.744