Dueling algorithms

DOI10.1145/1993636.1993666zbMath1288.68122OpenAlexW2293140407MaRDI QIDQ5419091

Ankur Moitra, Andrew Postlewaite, Brendan Lucier, Moshe Tennenholtz, Nicole Immorlica, Adam Tauman Kalai

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993636.1993666

zbMATH Keywords

algorithmscompetitionequilibrium

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Minimax problems in mathematical programming (90C47) 2-person games (91A05) Other game-theoretic models (91A40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (12)

Kernel Entropy Discriminant Analysis for Dimension Reduction ⋮ Secretary Markets with Local Information ⋮ Prophet inequality with competing agents ⋮ Unnamed Item ⋮ From Duels to Battlefields: Computing Equilibria of Blotto and Other Games ⋮ Strategic Online Facility Location ⋮ Multilinear Games ⋮ The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler ⋮ Secretary markets with local information ⋮ Unnamed Item ⋮ On the hardness of designing public signals ⋮ Equilibria in Online Games

This page was built for publication: Dueling algorithms