Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
Joshua R. Davis, Zachary Goldman, Jacob Hilty, Eli...
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...