Sciweavers

5995 search results - page 143 / 1199
» Algorithmic Game Theory
Sort
View
132
Voted
AAAI
2000
15 years 5 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CSL
2006
Springer
15 years 7 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
127
Voted
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
146
Voted
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 7 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
108
Voted
FSTTCS
2008
Springer
15 years 4 months ago
Solvency Games
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...
Noam Berger, Nevin Kapur, Leonard J. Schulman, Vij...