Sciweavers

108 search results - page 2 / 22
» Computational Methods for Oblivious Equilibrium
Sort
View
AMEC
2003
Springer
14 years 4 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
CDC
2008
IEEE
143views Control Systems» more  CDC 2008»
14 years 5 months ago
On the use of numerical methods for analysis and control of nonlinear convective systems
Abstract— A common approach to designing feedback controllers for nonlinear partial differential equations (PDEs) is to linearize the system about an equilibrium and use the line...
Edward Allen, John A. Burns, David S. Gilliam
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
13 years 1 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
IACR
2011
115views more  IACR 2011»
12 years 10 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
NOCS
2009
IEEE
14 years 5 months ago
Static virtual channel allocation in oblivious routing
Most virtual channel routers have multiple virtual channels to mitigate the effects of head-of-line blocking. When there are more flows than virtual channels at a link, packets o...
Keun Sup Shim, Myong Hyon Cho, Michel A. Kinsy, Ti...