15033 search results - page 120 / 3007 » Complexity Theory and Algorithms |
151
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
147
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
143
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
115
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
124
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...