« Back to Record
Citation APA

Brihaye, T., Bruyère, V., Goeminne, A., Raskin, J.-F., & Van Den Bogaard, M. (2020). The complexity of subgame perfect equilibria in quantitative reachability games. Logical methods in computer science, 16(4), 8:1-8:43. doi:10.23638/LMCS-16(4:8)2020


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/316627

Brihaye, T., Bruyère, V., Goeminne, A., Raskin, J.-F., & Van Den Bogaard, M. (2020). The complexity of subgame perfect equilibria in quantitative reachability games. Logical methods in computer science, 16(4), 8:1-8:43. doi:10.23638/LMCS-16(4:8)2020