Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dueling Algorithms   We revisit classic algorithmic search and optimization problems from the
perspective of competition. Rather than a single optimizer minimizing expected
cost, we consider a zero-sum game in which an optimization problem is presented
to two players, whose only goal is to outperform the opponent. Such games are
typically exponentially large zero-sum games, but they often have a rich
combinatorial structure. We provide general techniques by which such structure
can be leveraged to find minmax-optimal and approximate minmax-optimal
strategies. We give examples of ranking, hiring, compression, and binary search
duels, among others. We give bounds on how often one can beat the classic
optimization algorithms in such duels.

24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
2
The categories of this paper are: math
3
The categories of this paper are: physics