4435 search results - page 37 / 887 » Algorithms, games, and the internet |
ERSHOV
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
CIE
2008
Springer
13 years 12 months ago
2008
Springer
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...
LOGCOM
2002
13 years 9 months ago
2002
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...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
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 ...
NOSSDAV
2005
Springer
14 years 3 months ago
2005
Springer
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...