On the performance of user equilibria in traffic networks

Near-optimal network design with selfish agents

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

The price of anarchy is independent of the network topology

Journal of Computer and System Sciences - STOC 2002

Non-cooperative multicast and facility location games

EC '06 Proceedings of the 7th ACM conference on Electronic commerce

Network design with weighted players

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

Operations Research

Network formation games with local coalitions

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

Cooperation in Multiorganization Matching

Approximation and Online Algorithms

An O( lognloglogn) upper bound on the price of stability for undirected Shapley network design games

Information Processing Letters

Selfish bin covering

Theoretical Computer Science

On the inefficiency of equilibria in congestion games

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Network games with atomic players

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

The price of approximate stability for scheduling selfish tasks on two links

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Cooperation in multi-organization scheduling

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Selfishness level of strategic games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory

A distributed scheduling framework based on selfish autonomous agents for federated cloud environments

Future Generation Computer Systems