1969 search results - page 224 / 394 » Financial Theory 1 |
184
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
182
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
We analyze the performance of single-parameter mechanisms for markets in which there is competition amongst both consumers and suppliers (namely, two-sided markets). Specifically, ...
221
click to vote
NETWORKS
2011
14 years 8 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
169
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
139
Voted
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...