1380 search results - page 27 / 276 » Computing the optimal strategy to commit to |
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
VLDB
1992
ACM
13 years 11 months ago
1992
ACM
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
JMLR
2006
13 years 7 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...