Sciweavers

1167 search results - page 161 / 234
» Relational Markov Games
Sort
View
APAL
2010
98views more  APAL 2010»
13 years 10 months ago
Classical proof forestry
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...
Willem Heijltjes
POPL
2009
ACM
14 years 10 months ago
Formal certification of code-based cryptographic proofs
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...
Benjamin Grégoire, Gilles Barthe, Santiago ...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 10 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ö...
ATAL
2009
Springer
14 years 4 months ago
A memetic framework for describing and simulating spatial prisoner's dilemma with coalition formation
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 ...
Juan C. Burguillo-Rial
FCT
2003
Springer
14 years 3 months 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