Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Game-theoretic Network Centrality: A Review   Game-theoretic centrality is a flexible and sophisticated approach to
identify the most important nodes in a network. It builds upon the methods from
cooperative game theory and network theory. The key idea is to treat nodes as
players in a cooperative game, where the value of each coalition is determined
by certain graph-theoretic properties. Using solution concepts from cooperative
game theory, it is then possible to measure how responsible each node is for
the worth of the network.
  The literature on the topic is already quite large, and is scattered among
game-theoretic and computer science venues. We review the main game-theoretic
network centrality measures from both bodies of literature and organize them
into two categories: those that are more focused on the connectivity of nodes,
and those that are more focused on the synergies achieved by nodes in groups.
We present and explain each centrality, with a focus on algorithms and
complexity.

27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
16
The categories of this paper are: stat
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
35
The categories of this paper are: mtrl-th
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom