Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability

October 17, 2017 in by

by Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
Reference:
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin. Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. In Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (CSL’15), pages 504-518. Volume 41 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015.
Bibtex Entry:
@string{sep="September"}
@inproceedings{BBMR-csl15,
  address =       {Berlin, Germany},
  author =        {Brihaye, Thomas and Bruy{`e}re, V{'e}ronique and
                   Meunier, No{'e}mie and Raskin, Jean-Fran{c{c}}ois},
  booktitle =     {{P}roceedings of the 24th {EACSL} {A}nnual
                   {C}onference on {C}omputer {S}cience {L}ogic
                   ({CSL}'15)},
  editor =        {Kreutzer, Stephan},
  month =         sep,
  pages =         {504-518},
  publisher =     {Leibniz-Zentrum f{"u}r Informatik},
  series =        {Leibniz International Proceedings in Informatics},
  title =         {Weak Subgame Perfect Equilibria and their Application
                   to Quantitative Reachability},
  volume =        {41},
  year =          {2015},
  doi =           {10.4230/LIPIcs.CSL.2015.504},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BBMR-csl15.pdf},
  category =      {conf},
  wps =           {wp1},
  partners =      {ULB and UMONS},
  casstingpart =  {75},
}