Amanote Research

Amanote Research

    RegisterSign In

Robust Price of Anarchy Bounds via LP and Fenchel Duality

doi 10.1137/1.9781611973730.70
Full Text
Open PDF
Abstract

Available in full text

Date

December 22, 2014

Authors
Janardhan KulkarniVahab Mirrokni
Publisher

Society for Industrial and Applied Mathematics


Related search

Topological Price of Anarchy Bounds for Clustering Games on Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2012English

A Fenchel-Rockafellar Type Duality Theorem for Maximization

Bulletin of the Australian Mathematical Society
Mathematics
1979English

Selfish Routing and the Price of Anarchy

2006English

Algebraic Duality Theorems for Infinite LP Problems

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2011English

The Price of Anarchy for Restricted Parallel Links

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
2006English

The Price of Anarchy in Network Creation Games

2007English

New Regularity Conditions for Lagrange and Fenchel-Lagrange Duality in Infinite Dimensional Spaces

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2009English

The Price of Anarchy for Minsum Related Machine Scheduling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy