An efficient algorithm is provided that computes 0.3393- approximate equilibria, the best approximation till now, based on the formulation of an appropriate function of pairs of mixed strategies reflecting the maximum deviation of the players' payoffs from the best payoff each player could achieve given the strategy chosen by the other.Expand

A new algorithm for drawing a weighted random sample of size m from a population of n weighted items, where m ≤ n, is presented and can generate a weightedrandom sample in one-pass over unknown populations.Expand

This work provides a comprehensive collection of efficient algorithms, hardness results (both as NP-hardness and #P-completeness results), and structural results for these algorithmic problems related to the computation of Nash equilibria for the selfish routing game the authors consider.Expand

This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + ε)n space, and supports satellite information.Expand

Within the limits of the analysis that is mainly of asymptotic nature, BSP and LogP can be viewed as closely related variants within the bandwidth-latency framework for modeling parallel computation.Expand

It is proved that any weighted network congestion game with linear edge delays admits a pure Nash equilibrium that can be found in pseudo-polynomial time.Expand

A strong upper bound is provided on the value of c*, showing that for c > 4.758 a random 3-SAT formula is unsatisfiable with high probability, based on a structural property, possibly of independent interest, whose proof needs several applications of the occupancy tail bounds.Expand

This is the first dictionary that has worst case constant access time and expected constant update time, works with (1+?) n space, and supports satellite information.Expand