Sciweavers

3780 search results - page 398 / 756
» Algorithms for Game Metrics
Sort
View
JACM
2006
93views more  JACM 2006»
15 years 6 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 7 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
INFOCOM
2006
IEEE
16 years 26 days ago
An Optimal Dynamic Pricing Framework for Autonomous Mobile Ad Hoc Networks
— In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, ho...
Zhu Ji, Wei Yu, K. J. Ray Liu
FCT
2003
Springer
16 years 2 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle