Sciweavers

54 search results - page 5 / 11
» A Cryptographic Solution to a Game Theoretic Problem
Sort
View
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
14 years 11 days ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
GLOBECOM
2006
IEEE
14 years 1 months ago
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
Lacra Pavel
RTA
2005
Springer
14 years 1 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
DM
2007
125views more  DM 2007»
13 years 7 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
DM
2008
82views more  DM 2008»
13 years 7 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon