3 citations · 3 across the 5 of their papers we have counts for
4 papers · 1 filter
Swap Equilibria under Link and Vertex Destruction
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
We initiate the study of the \emph{destruction model} (\aka \emph{adversary model}) introduced by Kliemann (2010), using the stability concept of \emph{swap equilibrium} introduced…
Price of Anarchy for Graph Coloring Games with Concave Payoff
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
We study the price of anarchy in a class of graph coloring games (a subclass of polymatrix common-payoff games). In those games, players are vertices of an undirected, simple graph…
The Price of Anarchy in Bilateral Network Formation in an Adversary Model
Lasse Kliemann
We study network formation with the bilateral link formation rule (Jackson and Wolinsky 1996) with players and link cost . After the network is built, an adversary randoml…
The Price of Anarchy for Network Formation in an Adversary Model
Lasse Kliemann
We study network formation with n players and link cost α> 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Co…