Sciweavers

106 search results - page 4 / 22
» Connectivity and Equilibrium in Random Games
Sort
View
TON
2010
157views more  TON 2010»
13 years 2 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ICDCS
2012
IEEE
11 years 9 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
TCOM
2010
133views more  TCOM 2010»
13 years 5 months ago
Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies
Abstract——This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
J. Huang, V. Krishnamurthy
ATAL
2003
Springer
14 years 17 days ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...