Sciweavers

228 search results - page 6 / 46
» Expected Reachability-Time Games
Sort
View
DIGRA
2005
Springer
14 years 2 months ago
Bringing New HOPE to Networked Games: Using Optimistic Execution to Improve Quality of Service
As more games of a wider variety of genres move online to provide multiplayer experiences to their players, there is an increasing need to improve the quality of service delivered...
Michael Katchabaw, Ryan Hanna
JMLR
2010
103views more  JMLR 2010»
13 years 3 months ago
Regret Bounds and Minimax Policies under Partial Monitoring
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
Jean-Yves Audibert, Sébastien Bubeck
IACR
2011
152views more  IACR 2011»
12 years 8 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen
IADIS
2004
13 years 10 months ago
A Study on Mobile Game Adoption Under HPI(High-Speed Portable Internet) Environment
Mobile game is considered as one of the emerging mobile services in recent years. A number of mobile game companies have been established and on-line game providers have also atte...
Young Seog Yoon, Im Sook Há, Mun Kee Choi
JURIX
2007
13 years 10 months ago
Success chances in argument games: a probabilistic approach to legal disputes
The outcome of a legal dispute, namely, the decision of its adjudicator, is uncertain, and both parties develop their strategies on the basis of their appreciation of the probabili...
Régis Riveret, Antonino Rotolo, Giovanni Sa...