Risks faced by information system operators and users are not only determined by their own
security posture, but are also heavily affected by the security-related decisions of others …

The price of anarchy, defined as the ratio of the worst-case objective function value of a
Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of …

This paper examines the interconnections between the power and transportation networks
from a game theoretic perspective. Electric vehicle travelers choose the lowest-cost routes in …

We propose weakening the assumption made when studying the price of anarchy: Rather
than assume that self-interested players will play according to a Nash equilibrium (which …

Due to their broadcast nature, wireless networks are highly susceptible to jamming attacks
resulting in denial of service. Game theory provides powerful tools to model and analyze …

In this paper, we study the price of anarchy of traffic routing, under the assumption that users
are partially altruistic or spiteful. We model such behavior by positing that the" cost" …

We consider game theoretic models of wireless medium access control (MAC) in which each
transmitter makes individual decisions regarding their power level or transmission …

Adversarial team games model multiplayer strategic interactions in which a team of
identically-interested players is competing against an adversarial player in a zero-sum …

We study the inefficiency of equilibria for congestion games when players are (partially)
altruistic. We model altruistic behavior by assuming that player i's perceived cost is a convex …

A well-known result in game theory known as" the Folk Theorem" suggests that finding Nash
equilibria in repeated games should be easier than in one-shot games. In contrast, we show …