Sciweavers

144 search results - page 17 / 29
» Stackelberg Network Pricing Games
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Using Repeated Games to Design Incentive-Based Routing Systems
Abstract— Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties importa...
Michael Afergan
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
15 years 10 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
TWC
2008
111views more  TWC 2008»
14 years 9 months ago
A Game-Theoretic Approach for Exploiting Multiuser Diversity in Cooperative Slotted Aloha
Abstract-- Multiuser diversity gains can be achieved by assigning channels to users with better channel quality in multiuser systems. To avoid the extensive information exchange re...
Dandan Wang, Cristina Comaniciu, Hlaing Minn, Naof...
JSAC
2007
189views more  JSAC 2007»
14 years 9 months ago
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
Chengnian Long, Qian Zhang, Bo Li, Huilong Yang, X...
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
14 years 10 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli