From its introduction to its quindecennial, network coding has built a strong reputation for
enhancing packet recovery and achieving maximum information flow in both wired and …

A central goal in algorithmic game theory is to analyze the performance of decentralized
multiagent systems, like communication and information networks. In the absence of a …

The price of anarchy (PoA) in congestion games has attracted a lot of research over the past
decade. This has resulted in a thorough understanding of this concept. In contrast, the price …

In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider
the model where we are given an n-vertex graph G=(V, E, w) with positive real edge weights …

​ Congestion games are a fundamental class of games widely considered and studied in
non-cooperative game theory, introduced to model several realistic scenarios in which …

We give exponential lower bounds on the Price of Stability (PoS) of weighted congestion
games with polynomial cost functions. In particular, for any positive integer d we construct …

Affine congestion games are a well-studied model for selfish behavior in distributed systems,
such as transportation and communication networks. Seminal influential papers in …

In load-balancing problems there is a set of clients, each wishing to select a resource from a
set of permissible ones to execute a certain task. Each resource has a latency function …

We consider network cost-sharing games with nonanonymous cost functions, where the cost
of each edge is a submodular function of its users, and this cost is shared using the Shapley …

Motivated by possible applications in fault-tolerant routing, we introduce the notion of
uniform mixed equilibria in network congestion games with adversarial link failures, where …