✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6198 || On the Existence of Pure Nash Equilibria in Weighted Congestion Games

✍ Scribed by Abramsky, Samson; Gavoille, Cyril; Kirchner, Claude; Meyer auf der Heide, Friedhelm; Spirakis, Paul G.

Book ID: 121317903
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 196 KB
Category: Article
ISBN: 364214165X
DOI: 10.1007/978-3-642-14165-2_8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6198 || The Cooperative Game Theory Foundations of Network Bargaining Games

✍ Abramsky, Samson; Gavoille, Cyril; Kirchner, Claude; Meyer auf der Heide, Friedh 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 225 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Internet and Network Economics Volume 4858 || On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games

✍ Deng, Xiaotie; Graham, Fan Chung 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 503 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 267 || On the languages accepted by finite reversible automata

✍ Ottmann, Thomas 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 471 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 1443 || On computing the entropy of cellular automata

✍ Larsen, Kim G.; Skyum, Sven; Winskel, Glynn 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 626 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 1099 || On the power of randomized branching programs

✍ Meyer, Friedhelm; Monien, Burkhard 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 498 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 5125 || The Complexity of Boolean Formula Minimization

✍ Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólf 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 462 KB

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully rev