Sciweavers

3780 search results - page 54 / 756
» Algorithms for Game Metrics
Sort
View
CSE
2009
IEEE
14 years 3 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 10 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
QEST
2006
IEEE
14 years 2 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
HT
2003
ACM
14 years 2 months ago
Paper chase revisited: a real world game meets hypermedia
In this short paper, we present a location aware mobile game which lets users play a paper chase game on a mobile device. By using their physical movement and location in the real...
Susanne Boll, Jens Krösche, Christian Wegener
IR
2010
13 years 7 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu