• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Hardness of Approximation Between P and NP

Hardness of Approximation Between P and NP

Paperback

Series: ACM Books

General ComputersGeneral MathematicsProgramming

ISBN10: 1947487205
ISBN13: 9781947487208
Publisher: Lightning Source Inc
Published: Jun 7 2019
Pages: 319
Weight: 1.22
Height: 0.67 Width: 7.50 Depth: 9.25
Language: English

Nash equilibrium is the central solution concept in Game Theory.

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.

1 different editions

Also available

Also in

General Computers