Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Selfish Network Creation with Non-Uniform Edge Cost   Network creation games investigate complex networks from a game-theoretic
point of view. Based on the original model by Fabrikant et al. [PODC'03] many
variants have been introduced. However, almost all versions have the drawback
that edges are treated uniformly, i.e. every edge has the same cost and that
this common parameter heavily influences the outcomes and the analysis of these
games.
  We propose and analyze simple and natural parameter-free network creation
games with non-uniform edge cost. Our models are inspired by social networks
where the cost of forming a link is proportional to the popularity of the
targeted node. Besides results on the complexity of computing a best response
and on various properties of the sequential versions, we show that the most
general version of our model has constant Price of Anarchy. To the best of our
knowledge, this is the first proof of a constant Price of Anarchy for any
network creation game.

5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
30
The categories of this paper are: q-alg
37
The categories of this paper are: supr-con