Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Interference Games in Wireless Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Reservation-based distributed medium access in wireless collision channels
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Contention resolution under selfishness
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We seek to understand behavior of selfish agents accessing a broadcast channel. In particular, we consider the natural agent utility where costs are proportional to delay. Access to the channel is modelled as a game in extensive form with simultaneous play. Standard protocols such as Aloha are vulnerable to manipulation by selfish agents. We show that choosing appropriate transmission probabilities for Aloha to achieve equilibrium implies exponentially long delays. We give a very simple protocol for the agents that is in Nash equilibrium and is also very efficient --- other than with exponentially negligible probability --- all n agents will successfully transmit within cn time, for some small constant c.