Pseudopolynomial Iterative Algorithm to Solve Total-Payoff Games and Min-Cost Reachability Games

December 16, 2017 in by

by Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Reference:
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Pseudopolynomial Iterative Algorithm to Solve Total-Payoff Games and Min-Cost Reachability Games. In Acta Informatica. Springer, 2016. (To appear)
Bibtex Entry:
@article{BGHM-acta16,
  author =        {Brihaye, Thomas and Geeraerts, Gilles and
                   Haddad, Axel and Monmege, Benjamin},
  journal =       {Acta Informatica},
  note =          {To~appear},
  publisher =     {Springer},
  title =         {Pseudopolynomial Iterative Algorithm to Solve
                   Total-Payoff Games and Min-Cost Reachability Games},
  year =          {2016},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BGHM-acta16.pdf},
  category =      {jour},
  wps =           {wp2},
  partners =      {UMONS and ULB},
  casstingpart =  {100},
}