Sciweavers

350 search results - page 36 / 70
» Approximation Algorithms for Unique Games
Sort
View
136
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
Game Theoretic Rate Adaptation for Spectrum-Overlay Cognitive Radio Networks
— We consider the issue of fair share of the spectrum opportunity for the case of spectrum-overlay cognitive radio networks. Owing to the decentralized nature of the network, we ...
Laxminarayana S. Pillutla, Vikram Krishnamurthy
TSP
2008
167views more  TSP 2008»
15 years 2 months ago
Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network
Abstract--We present decentralized adaptive filtering algorithms for sensor activation control in an unattended ground sensor network (UGSN) comprised of ZigBee-enabled nodes. Node...
Vikram Krishnamurthy, Michael Maskery, Gang George...
99
Voted
COCOA
2009
Springer
15 years 9 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis
FSTTCS
2006
Springer
15 years 6 months ago
Normal and Feature Approximations from Noisy Point Clouds
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
Tamal K. Dey, Jian Sun
ATAL
2009
Springer
15 years 9 months ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...