2560 search results - page 1 / 512 » Contributions to zero-sum problems |
AAAI
2007
13 years 7 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
ICDCSW
2005
IEEE
13 years 10 months ago
2005
IEEE
The problem of spam is a classic “tragedy of the commons” [10]. We propose the Zmail protocol as a way to preserve email as a “free” common resource for most users, while ...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear systems Ax = b, we show that this condi...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...