Sciweavers

107 search results - page 16 / 22
» Near-optimal algorithms for unique games
Sort
View
WINE
2010
Springer
201views Economy» more  WINE 2010»
13 years 5 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 10 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 7 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 6 days ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
INFOCOM
2012
IEEE
11 years 10 months ago
Uplink soft frequency reuse for self-coexistence of cognitive radio networks operating in white-space spectrum
—Recent advances in cognitive radio (CR) technology have brought about a number of wireless standards that support opportunistic access to available white-space spectrum. Address...
Bo Gao, Jung-Min Park 0001, Yaling Yang