Data networks
Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
Online learning about other agents in a dynamic multiagent system
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Conjectural Equilibrium in Multiagent Learning
Machine Learning
Efficiency Loss in a Network Resource Allocation Game
Mathematics of Operations Research
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Learning payoff functions in infinite games
Machine Learning
A stackelberg game for power control and channel allocation in cognitive radio networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Utility-optimal random access without message passing
IEEE Transactions on Wireless Communications
Correlated equilibrium in access control for wireless communications
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Reverse-Engineering MAC: A Non-Cooperative Game Model
IEEE Journal on Selected Areas in Communications
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
A hierarchical slotted aloha game
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A unique beamforming-based equilibrium in multi-user random access SIMO networks
IEEE Communications Letters
Modeling slotted aloha as a stochastic game with random discrete power selection algorithms
Journal of Computer Systems, Networks, and Communications
MAC layer jamming mitigation using a game augmented by intervention
EURASIP Journal on Wireless Communications and Networking
Near-optimal deviation-proof medium access control designs in wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Interactions among selfish users sharing a common transmission channel can be modeled as a noncooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any coordination mechanism, Nash equilibria usually result in a network collapse. We propose a methodology that transforms the noncooperative game into a Stackelberg game. Stackelberg equilibria of the Stackelberg game can overcome the deficiency of the Nash equilibria of the original game. A particular type of Stackelberg intervention is constructed to show that any positive payoff profile feasible with independent transmission probabilities can be achieved as a Stackelberg equilibrium payoff profile.We discuss criteria to select an operating point of the network and informational requirements for the Stackelberg game. We relax the requirements and examine the effects of relaxation on performance.