A Lower Bound on Swap Regret in Extensive-Form Games.
Constantinos DaskalakisGabriele FarinaNoah GolowichTuomas SandholmBrian Hu ZhangPublished in: CoRR (2024)
Keyphrases
- lower bound
- extensive form games
- upper bound
- influence diagrams
- branch and bound algorithm
- branch and bound
- np hard
- worst case
- graph cuts
- lower and upper bounds
- optimal solution
- objective function
- multi agent
- decision problems
- online algorithms
- sensitivity analysis
- regret bounds
- scheduling problem
- neural network
- competitive ratio
- decision making