Sciweavers

108 search results - page 1 / 22
» Computational Methods for Oblivious Equilibrium
Sort
View
IOR
2010
86views more  IOR 2010»
13 years 3 months ago
Computational Methods for Oblivious Equilibrium
Gabriel Y. Weintraub, C. Lanier Benkard, Benjamin ...
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
13 years 11 months ago
Oblivious equilibrium for large-scale stochastic games with unbounded costs
— We study stochastic dynamic games with a large number of players, where players are coupled via their cost functions. A standard solution concept for stochastic games is Markov...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
13 years 9 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
ICS
2005
Tsinghua U.
13 years 10 months ago
Cache oblivious stencil computations
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...
Matteo Frigo, Volker Strumpen
AAAI
2004
13 years 6 months ago
Simple Search Methods for Finding a Nash Equilibrium
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
Ryan Porter, Eugene Nudelman, Yoav Shoham