481 search results - page 54 / 97 » Martin's game: a lower bound for the number of sets |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...
SODA
2007
ACM
13 years 10 months ago
2007
ACM
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
CRYPTO
2000
Springer
14 years 1 months ago
2000
Springer
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...
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...