Dueling algorithms
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Minimax problems in mathematical programming (90C47) 2-person games (91A05) Other game-theoretic models (91A40)
Recommendations
Cited in
(15)- Secretary markets with local information
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
- On the hardness of designing public signals
- Prophet inequality with competing agents
- Equilibria in online games
- Efficient online algorithmic strategies for several two-player games with different or identical player roles
- Strategic online facility location
- Multilinear games
- Secretary markets with local information
- Competing bandits: learning under competition
- Kernel entropy discriminant analysis for dimension reduction
- Strategies for quantum races
- From duels to battlefields: computing equilibria of Blotto and other games
- Scalable Optimal Classifiers for Adversarial Settings Under Uncertainty
- Competitive secretary problem
This page was built for publication: Dueling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419091)