Sciweavers

16 search results - page 3 / 4
» tark 2009
Sort
View
TARK
2009
Springer
13 years 11 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass
TARK
2009
Springer
13 years 11 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
TARK
2009
Springer
13 years 11 months ago
A logic of propositional control for truthful implementations
We introduce a logic designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent prefere...
Nicolas Troquard, Wiebe van der Hoek, Michael Wool...
TARK
2009
Springer
13 years 11 months ago
An epistemic characterization of zero knowledge
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
Joseph Y. Halpern, Rafael Pass, Vasumathi Raman
TARK
2009
Springer
13 years 11 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow