Sciweavers

350 search results - page 22 / 70
» Approximation Algorithms for Unique Games
Sort
View
142
Voted
ICMLA
2009
15 years 7 days ago
ECON: A Kernel Basis Pursuit Algorithm with Automatic Feature Parameter Tuning, and its Application to Photometric Solids Approx
This paper introduces a new algorithm, namely the EquiCorrelation Network (ECON), to perform supervised classification, and regression. ECON is a kernelized LARS-like algorithm, b...
Manuel Loth, Philippe Preux, Samuel Delepoulle, Ch...
INFOCOM
2010
IEEE
15 years 29 days ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 8 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 8 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
ICALP
2010
Springer
15 years 4 months ago
The Cooperative Game Theory Foundations of Network Bargaining Games
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...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...