1167 search results - page 161 / 234 » Relational Markov Games |
154
click to vote
APAL
2010
15 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
324
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
182
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
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...
190
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
216
click to vote
FCT
2003
Springer
16 years 1 days ago
2003
Springer
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...