To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games

October 17, 2017 in by

by Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Reference:
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR’15), pages 297-310. Volume 42 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015.
Bibtex Entry:
@string{sep="September"}
@inproceedings{BGHM-concur15,
  address =       {Madrid, Spain},
  author =        {Brihaye, Thomas and Geeraerts, Gilles and
                   Haddad, Axel and Monmege, Benjamin},
  booktitle =     {{P}roceedings of the 26th {I}nternational
                   {C}onference on {C}oncurrency {T}heory ({CONCUR}'15)},
  editor =        {Aceto, Luca and de Frutos Escrig, David},
  month =         sep,
  pages =         {297-310},
  publisher =     {Leibniz-Zentrum f{"u}r Informatik},
  series =        {Leibniz International Proceedings in Informatics},
  title =         {To~Reach or not to Reach? Efficient Algorithms for
                   Total-Payoff Games},
  volume =        {42},
  year =          {2015},
  doi =           {10.4230/LIPIcs.CONCUR.2015.297},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BGHM-concur15.pdf},
  category =      {conf},
  wps =           {wp2},
  partners =      {ULB and UMONS},
  casstingpart =  {100},
}