Sciweavers

5995 search results - page 154 / 1199
» Algorithmic Game Theory
Sort
View
SCP
2008
91views more  SCP 2008»
15 years 3 months ago
Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towa...
Jerry den Hartog
SYNASC
2006
IEEE
67views Algorithms» more  SYNASC 2006»
15 years 9 months ago
Mathematical Theory Exploration
Bruno Buchberger
ICML
2008
IEEE
16 years 4 months ago
No-regret learning in convex games
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
Geoffrey J. Gordon, Amy R. Greenwald, Casey Marks
CIE
2010
Springer
15 years 8 months ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram