Sciweavers

894 search results - page 54 / 179
» Game Theory with Costly Computation
Sort
View
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
15 years 4 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
CORR
2012
Springer
286views Education» more  CORR 2012»
14 years 1 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
KIVS
1999
Springer
15 years 10 months ago
Cost and Price Calculation for Internet Integrated Services
Abstract Charging schemes are needed to protect an integrated services network from arbitrary resource reservations and to create a funding mechanism to extend network capacity at ...
Martin Karsten, Jens Schmitt, Lars C. Wolf, Ralf S...
CHI
2008
ACM
16 years 6 months ago
The cost of interrupted work: more speed and stress
We performed an empirical study to investigate whether the context of interruptions makes a difference. We found that context does not make a difference but surprisingly, people c...
Gloria Mark, Daniela Gudith, Ulrich Klocke
NOSSDAV
2005
Springer
15 years 11 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...