5995 search results - page 44 / 1199 » Algorithmic Game Theory |
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
117
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
CCL
1994
Springer
15 years 3 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...