Sciweavers

350 search results - page 23 / 70
» Approximation Algorithms for Unique Games
Sort
View
145
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 11 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 5 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 5 months ago
The MIMO Iterative Waterfilling Algorithm
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...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
164
Voted
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
15 years 1 days ago
Learning in mean-field oscillator games
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday...
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
15 years 11 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso