Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Adaptivity in agent-based routing for data networks
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
An agent architecture for vehicle routing problems
Proceedings of the 2001 ACM symposium on Applied computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tutorial: mobile software agents for dynamic routing
ACM SIGMOBILE Mobile Computing and Communications Review
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Proceedings of the 9th annual international conference on Mobile computing and networking
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Truthful multicast routing in selfish wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
Agent based systems are being used to solve problems ranging from Web search strategies to autonomous robots.In this paper we discuss a multi-agent based selfish routing problem in multi-channel wireless mesh networks. In this selfish routing, k pairs of source-sink (destination) pairs are managed by k different intelligent agents. All the agents are selfish; each agent’s goal is to minimize its own cost without considering the overall performance of the network. Meanwhile, the agents are rational, they always meet the embarrassment that whether they face the probability of causing interference for routing flow by a short cut or they route flow by a longer way steadily. We introduce the game theoretic tools to direct the agents to make feasible choices. We yield a sufficient condition of the existence of pure strategy Nash equilibria and proof it in this paper (we call this the Strong Transmission Game). Some simulations reveal the feasibility of our proposition.