Approximation via Cost Sharing

Source URL: theory.stanford.edu

On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence Nathaniel Korda MLRG, University of Oxford, UK. Prashanth L.A.

Source URL: ewrl.files.wordpress.com

√ An LP-Rounding 2 2-Approximation for Restricted Maximum Acyclic Subgraph Fabrizio Grandonia , Tomasz Kociumakab , Michał Włodarczykb b

Source URL: people.idsia.ch

Barriers to Near-Optimal Equilibria Tim Roughgarden Computer Science Department Stanford University Stanford, CA, USA Email:

Source URL: theory.stanford.edu

• Game theory
• Price of anarchy
• Approximation algorithm
• Mathematical optimization
• Epsilon-equilibrium
• Congestion game
• Optimization problem
• Computational complexity theory
• Nash equilibrium
• Mechanism design

Noname manuscript No. (will be inserted by the editor) Extended Formulations in Mixed Integer Conic Quadratic Programming Juan Pablo Vielma, Iain Dunning, Joey Huchette and Miles

Source URL: web.mit.edu

• Operations research
• Combinatorial optimization
• Approximations
• Mathematical optimization
• Relaxation
• Linear programming relaxation
• Linear programming
• Integer programming
• Approximation algorithm
• Constructible universe

Efficient Evaluation and Approximation of Well-designed Pattern Trees Pablo Barceló Reinhard Pichler

Source URL: users.dcc.uchile.cl

Optimal discrete hedging and approximation of stochastic integrals Carl Lindberg Holger Rootzén, Mathematical Sciences, Chalmers

Source URL: www.math.chalmers.se

Approximation numbers of Sobolev embeddings – sharp constants and tractability Thomas K¨ uhna , Winfried Sickelb and Tino Ullrichc a

Source URL: ullrich.ins.uni-bonn.de

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

DFG-Schwerpunktprogramm 1324 Extraktion quantifizierbarer Information aus komplexen Systemen” ” Dynamical approximation of hierarchical Tucker and Tensor-Train tensors

Source URL: www.dfg-spp1324.de