Sciweavers

108 search results - page 13 / 22
» -Hardness of Pure Nash Equilibrium in Scheduling and Connect...
Sort
View
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 9 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
SUTC
2010
IEEE
13 years 11 months ago
Data Caching in Ad Hoc Networks Using Game-Theoretic Analysis
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
Yutian Chen, Bin Tang
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
INFOCOM
2012
IEEE
11 years 9 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu
WIOPT
2006
IEEE
14 years 1 months ago
Reverse engineering MAC
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Ao Tang, Jang-Won Lee, Jianwei Huang, Mung Chiang,...