904 search results - page 66 / 181 » Game Theory |
138
click to vote
NOSSDAV
2005
Springer
15 years 10 months ago
2005
Springer
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
126
click to vote
JUCS
2007
15 years 4 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
124
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
262
click to vote
CORR
2012
Springer
14 years 2 days ago
2012
Springer
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
158
click to vote
IJNSEC
2006
15 years 4 months ago
2006
Nodes in a mobile ad hoc network need to thwart various attacks and malicious activities. This is especially true for the ad hoc environment where there is a total lack of central...