"Combining Incremental Strategy Generation and Branch and Bound Search for ..."

Jirí Cermák, Branislav Bosanský, Michal Pechoucek (2017)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-11

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/atal/CermakBP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/CermakBP17
Jirí Cermák, Branislav Bosanský, Michal Pechoucek:
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAMAS 2017: 902-910

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.