Sciweavers

1884 search results - page 94 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
CCS
2009
ACM
15 years 6 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
COMPGEOM
2005
ACM
15 years 1 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
ALGORITHMICA
2007
132views more  ALGORITHMICA 2007»
15 years 17 hour ago
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
We study the problem of providing a sensor with an accurate estimate of the time, from a novel perspective which is complementary to the well-studied clock synchronization problem....
Daniela Tulone
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
15 years 6 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
NIPS
2007
15 years 1 months ago
Computing Robust Counter-Strategies
Adaptation to other initially unknown agents often requires computing an effective counter-strategy. In the Bayesian paradigm, one must find a good counterstrategy to the inferre...
Michael Johanson, Martin Zinkevich, Michael H. Bow...