Sciweavers

769 search results - page 49 / 154
» Where Is the Proof
Sort
View
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 8 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
JCT
2011
89views more  JCT 2011»
13 years 3 months ago
On lines, joints, and incidences in three dimensions
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
György Elekes, Haim Kaplan, Micha Sharir
TARK
2009
Springer
14 years 3 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
FSE
2007
Springer
105views Cryptology» more  FSE 2007»
14 years 3 months ago
New Bounds for PMAC, TMAC, and XCBC
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...
Kazuhiko Minematsu, Toshiyasu Matsushima
COLT
2005
Springer
14 years 2 months ago
The Value of Agreement, a New Boosting Algorithm
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
Boaz Leskes