Network design is a fundamental problem for which it is important to understand the effects
of strategic behavior. Given a collection of self-interested agents who want to form a network …

Designing and deploying a network protocol determines the rules by which end users
interact with each other and with the network. We consider the problem of designing a …

We study the speed of convergence of decentralized dynamics to approximately optimal
solutions in potential games. We consider α-Nash dynamics in which a player makes a …

We consider the problem of designing distribution rules to share “welfare”(cost or revenue)
among individually strategic agents. There are many known distribution rules that guarantee …

It is well known that strategic behavior in elections is essentially unavoidable; we therefore
ask: how bad can the rational outcome be? We answer this question via the notion of the …

Internet of Things (IoT) devices have enabled communications in resource-limited
computing environments. Sensor nodes from the multiple IoT devices collectively work for …

Typical models of strategic interactions in computer science use simultaneous move games.
However, in applications simultaneity is often hard or impossible to achieve. In this paper …

Congestion games constitute an important class of games in which computing an exact or
even approximate pure Nash equilibrium is in general PLS-complete. We present a …

We study network design games where n self-interested agents have to form a network by
purchasing links from a given set of edges. We consider Shapley cost sharing mechanisms …

We introduce a simple network design game that models how independent selfish agents
can build or maintain a large network. In our game every agent has a specific connectivity …