Abstract
The main tool used to show all the results in this book is the primal-dual method. Introduced by Bil`o [22], this framework is based on the construction and analysis of a primal-dual pair of linear programs, where the dual is used to provide tight (or almost tight) upper bounds on the performance guarantee of a certain efficiency metric, and the primal is used to construct tight (or almost tight) lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bilò, V., Vinci, C. (2023). Bounding the Inefficiency via the Primal-Dual Method. In: Co** with Selfishness in Congestion Games. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-031-30261-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-30261-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30260-2
Online ISBN: 978-3-031-30261-9
eBook Packages: Computer ScienceComputer Science (R0)