Upper bounds on positional Paris-Harrington games.
Lorenzo CarlucciMassimo LauriaPublished in: Discret. Math. (2021)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- sample size
- relational database design
- lower and upper bounds
- sample complexity
- computer games
- game theory
- error probability
- video games
- branch and bound algorithm
- tight bounds
- worst case
- databases
- efficiently computable
- game play
- game theoretic
- tight upper and lower bounds
- game design
- nash equilibria
- online game
- nash equilibrium
- branch and bound
- digital games
- constant factor
- database management
- perfect information
- game players
- database design
- special case
- objective function