107 search results - page 9 / 22 » Near-optimal algorithms for unique games |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...