Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bottleneck Routing Games with Low Price of Anarchy   We study {\em bottleneck routing games} where the social cost is determined
by the worst congestion on any edge in the network. In the literature,
bottleneck games assume player utility costs determined by the worst congested
edge in their paths. However, the Nash equilibria of such games are inefficient
since the price of anarchy can be very high and proportional to the size of the
network. In order to obtain smaller price of anarchy we introduce {\em
exponential bottleneck games} where the utility costs of the players are
exponential functions of their congestions. We find that exponential bottleneck
games are very efficient and give a poly-log bound on the price of anarchy:
$O(\log L \cdot \log |E|)$, where $L$ is the largest path length in the
players' strategy sets and $E$ is the set of edges in the graph. By adjusting
the exponential utility costs with a logarithm we obtain games whose player
costs are almost identical to those in regular bottleneck games, and at the
same time have the good price of anarchy of exponential games.

37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
8
The categories of this paper are: hep-ex
28
The categories of this paper are: alg-geom
19
The categories of this paper are: eess
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex