Sciweavers

350 search results - page 30 / 70
» On Strategy Improvement Algorithms for Simple Stochastic Gam...
Sort
View
152
Voted
CG
2004
Springer
15 years 8 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
P2P
2003
IEEE
110views Communications» more  P2P 2003»
15 years 10 months ago
The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems
In this paper, we take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes ...
Giwon On, Jens Schmitt, Ralf Steinmetz
165
Voted
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
15 years 3 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,...
FPCA
1995
15 years 8 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
218
Voted
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...