Publication Date:
2020-08-05
Description:
We introduce the class of spot-checking games (SC games). These games model
problems where the goal is to distribute fare inspectors over a toll network.
In an SC game, the pure strategies of network users correspond to
paths in a graph, and the pure strategies of the inspectors
are subset of edges to be controlled.
Although SC games are not zero-sum, we show that a Nash equilibrium
can be computed by linear programming.
The computation of a strong Stackelberg equilibrium is
more relevant for this problem, but we show that this is NP-hard.
However, we give some bounds on the \emph{price of spite},
which measures how the
payoff of the inspector
degrades when committing to a Nash equilibrium.
Finally, we demonstrate the quality of these bounds for a real-world application,
namely the enforcement of a truck toll on German motorways.
Language:
English
Type:
reportzib
,
doc-type:preprint
Format:
application/pdf
Format:
application/pdf
Format:
application/pdf
Permalink
