Sciweavers

3780 search results - page 39 / 756
» Algorithms for Game Metrics
Sort
View
CIE
2008
Springer
13 years 10 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani
LOGCOM
2002
100views more  LOGCOM 2002»
13 years 8 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
ICCV
2009
IEEE
13 years 6 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
ATAL
2007
Springer
14 years 2 months ago
An adaptive strategy for minority games
Many real life situations, like the financial market, auctions and resources competitions, can be modeled as Minority Games. In minority games, players choose to join one of the ...
Ka-man Lam, Ho-fung Leung
NOSSDAV
2005
Springer
14 years 2 months ago
Mitigating information exposure to cheaters in real-time strategy games
Cheating in on-line games is a prevalent problem for both game makers and players. The popular real-time strategy game genre is especially vulnerable to cheats, as it is frequentl...
Chris Chambers, Wu-chang Feng, Wu-chi Feng, Debanj...