1802 search results - page 154 / 361 » Complexity Theory for Operators in Analysis |
143
click to vote
ATAL
2007
Springer
16 years 18 days 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...
169
click to vote
ATAL
2007
Springer
16 years 18 days 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...
170
click to vote
SIGECOM
2006
ACM
16 years 11 days ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
156
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...