108 search results - page 3 / 22 » Computational Methods for Oblivious Equilibrium |
MP
2008
13 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
IMC
2010
ACM
13 years 4 months ago
2010
ACM
Previous methods of network anomaly detection have focused on defining a temporal model of what is "normal," and flagging the "abnormal" activity that does not...
SIGMETRICS
2010
ACM
13 years 6 months ago
2010
ACM
When many flows are multiplexed on a non-saturated link, their volume changes over short timescales tend to cancel each other out, making the average change across flows close to ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...