The price of anarchy is independent of the network topology
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Multi-Agent Service Description/Discovery Games
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
Proceedings of the 6th ACM conference on Electronic commerce
Inefficiency in provisioning interconnected communication networks
Proceedings of the 6th ACM conference on Electronic commerce
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Strategyproof mechanisms towards dynamic topology formation in autonomous networks
Mobile Networks and Applications
Modeling energy constrained routing in selfish ad hoc networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
On selfish routing in internet-like environments
IEEE/ACM Transactions on Networking (TON)
Stackelberg thresholds in network routing games or the value of altruism
Proceedings of the 8th ACM conference on Electronic commerce
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network
Computer Communications
Fast load balancing via bounded best response
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Trust-based evolutionary game model assisting AODV routing against selfishness
Journal of Network and Computer Applications
Computers & Mathematics with Applications
Theoretical Computer Science
Stackelberg Routing in Arbitrary Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Models of Non-atomic Congestion Games --- From Unicast to Multicast Routing
Algorithmics of Large and Complex Networks
Journal of Artificial Intelligence Research
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On provisioning in all-optical networks: an impairment-aware approach
IEEE/ACM Transactions on Networking (TON)
Market-based cooperative resource allocation for overlay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
GADIA: A greedy asynchronous distributed interference avoidance algorithm
IEEE Transactions on Information Theory
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Theoretical Computer Science
Can altruism spare energy in ad hoc networking?
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
The price of anarchy in selfish multicast routing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Price of anarchy of network routing games with incomplete information
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Extending the notion of rationality of selfish agents: second order Nash equilibria
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.06 |