Description:
UsedVeryGood. Fast Shipping - Safe and Secure 7 days a week!
Stock Photo: Cover May Be Different
Hardness of Approximation Between P and NP Hardcover -
by Aviad Rubinstein
Details
- Title Hardness of Approximation Between P and NP
- Author Aviad Rubinstein
- Binding Hardcover
- Pages 319
- Volumes 1
- Language ENG
- Publisher ACM Books
- ISBN 9781947487239 / 194748723X
- Weight 1.68 lbs (0.76 kg)
- Dimensions 9.25 x 7.5 x 0.75 in (23.50 x 19.05 x 1.91 cm)
More Copies for Sale
Stock Photo: Cover May Be Different
Hardness of Approximation Between P and NP (ACM Books)
- Used
- Condition
- UsedVeryGood
- ISBN 10 / ISBN 13
- 9781947487239 / 194748723X
- Quantity Available
- 1
- Seller
-
Center Moriches, New York, United States
- Item Price
-
£67.73£2.42 shipping to USA
Show Details
Item Price
£67.73
£2.42
shipping to USA
Stock Photo: Cover May Be Different
Hardness of Approximation Between P and NP
by Aviad Rubinstein
- New
- Hardcover
- Condition
- New
- Binding
- Hardcover
- ISBN 10 / ISBN 13
- 9781947487239 / 194748723x
- Quantity Available
- 10
- Seller
-
Southport, Merseyside, United Kingdom
- Item Price
-
£116.84£9.95 shipping to USA
Show Details
Description:
Hardback. New. Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. This book provides strong evidence that even finding an approximate Nash equilibrium is intractable.
Item Price
£116.84
£9.95
shipping to USA
Hardness of Approximation Between P and NP (ACM Books)
by Rubinstein, Aviad
- New
- Hardcover
- Condition
- New
- Binding
- Hardcover
- ISBN 10 / ISBN 13
- 9781947487239 / 194748723x
- Quantity Available
- 1
- Seller
-
Kraków, Poland
- Item Price
-
£69.20£12.85 shipping to USA
Show Details
Description:
Morgan & Claypool Publishers, 2019 8vo (24.5 cm), XV, 304 pp. Publisher's laminated boards. "Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed. Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that…
Read More Item Price
£69.20
£12.85
shipping to USA