Congestion resulting from increased capacity in single-server queueing networks
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the first international conference on Information and computation economies
The POPCORN market—an online market for computational resources
Proceedings of the first international conference on Information and computation economies
A market-based architecture for management of geographically dispersed, replicated Web servers
Proceedings of the first international conference on Information and computation economies
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A game-theoretic formulation of multi-agent resource allocation
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Adaptivity in agent-based routing for data networks
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
Journal of the ACM (JACM)
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Negotiation and Equilibria in User Competition for Resources: A Dynamic Plot Approach
Computational & Mathematical Organization Theory
ACM SIGACT news distributed computing column 9
ACM SIGACT News
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
Protection of Fairness for Multimedia Traffic Streams in a Non-cooperative Wireless LAN Setting
PROMS 2001 Proceedings of the 6th International Conference on Protocols for Multimedia Systems
Competitive routing and flow control in communication networks of parallel links
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Atomic Resource Sharing in Noncooperative Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Hardness results for multicast cost sharing
Theoretical Computer Science
Networked games: a QoS-sensitive application for QoS-insensitive users?
RIPQoS '03 Proceedings of the ACM SIGCOMM workshop on Revisiting IP QoS: What have we learned, why do we care?
Avoiding paradoxes in multi-agent competitive routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability vs optimality tradeoff in game theoretic mechanisms for QoS provision
Proceedings of the 2003 ACM symposium on Applied computing
Network QoS games: stability vs optimality tradeoff
Journal of Computer and System Sciences
A survey on networking games in telecommunications
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
On selfish routing in internet-like environments
IEEE/ACM Transactions on Networking (TON)
A game-theoretic study of CSMA/CA under a backoff attack
IEEE/ACM Transactions on Networking (TON)
Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
Mathematics of Operations Research
Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network
Computer Communications
Mixed Nash equilibria in selfish routing problems with dynamic constraints
Theoretical Computer Science
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A comparative analysis of server selection in content replication networks
IEEE/ACM Transactions on Networking (TON)
Capacity management and equilibrium for proportional QoS
IEEE/ACM Transactions on Networking (TON)
Theoretical Computer Science
Collective intelligence, data routing and braess' paradox
Journal of Artificial Intelligence Research
Conjectural equilibrium in multiuser power control games
IEEE Transactions on Signal Processing
Eliciting Coordination with Rebates
Transportation Science
A survey on networking games in telecommunications
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
A game theoretic framework for joint routing and pricing in networks with elastic demands
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
On the base station selection and base station sharing in self-configuring networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A survey of uniqueness results for selfish routing
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Performance of server selection algorithms for content replication networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Performance evaluation of optimal aggregate-flow scheduling: a simulation study
Computer Communications
A Cooperative Differential Game Model for Multiuser Rate-Based Flow Control
Wireless Personal Communications: An International Journal
Hi-index | 0.08 |
In noncooperative networks users make control decisions that optimize their individual performance measure. Focusing on routing, two methodologies for architecting noncooperative networks are devised, that improve the overall network performance. These methodologies are motivated by problem settings arising in the provisioning and the run time phases of the network. For either phase, Nash equilibria characterize the operating point of the network. The goal in the provisioning phase is to allocate link capacities that lead to systemwide efficient Nash equilibria. The solution of such design problems is, in general, counterintuitive, since adding link capacity might lead to degradation of user performance. For systems of parallel links, it is shown that such paradoxes cannot occur and that the optimal solution coincides with the solution in the single-user case. Extensions to general network topologies are derived. During the run time phase, a manager controls the routing of part of the network flow. The manager is aware of the noncooperative behavior of the users and makes its routing decisions based on this information while aiming at improving the overall system performance. We obtain necessary and sufficient conditions for enforcing an equilibrium that coincides with the global network optimum, and indicate that these conditions are met in many cases of interest