5995 search results - page 1104 / 1199 » Algorithmic Game Theory |
113
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
130
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
79
Voted
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
117
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...