Sciweavers

3228 search results - page 635 / 646
» Computationally Sound Proofs
Sort
View
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
14 years 28 days ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
COLT
1999
Springer
14 years 26 days ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
AUSAI
1998
Springer
14 years 25 days ago
A Formal Embedding of AgentSpeak(L) in 3APL
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 21 days ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ATAL
2006
Springer
14 years 10 days ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo