Result 1 to 20 of 24 total
Random bimatrix games are asymptotically easy to solve (a simple proof). (English)
Persiano, Giuseppe (ed.), Algorithmic game theory. 4th international symposium, SAGT 2011, Amalfi, Italy, October 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24828-3/pbk). Lecture Notes in Computer Science 6982, 190-199 (2011).
1
Random bimatrix games are asymptotically easy to solve (A simple proof) (English)
SAGT, 190-199 (2011).
2
Rationality authority for provable rational behavior (English)
PODC, 289-290 (2011).
3
Distributed game-theoretic vertex coloring. (English)
Lu, Chenyang (ed.) et al., Principles of distributed systems. 14th international conference, OPODIS 2010, Tozeur, Tunisia, December 14‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17652-4/pbk). Lecture Notes in Computer Science 6490, 103-118 (2010).
4
Fun with games. (English)
Boldi, Paolo (ed.), Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2‒4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13121-9/pbk). Lecture Notes in Computer Science 6099, 4-15 (2010).
5
Distributed game-theoretic vertex coloring (English)
OPODIS, 103-118 (2010).
6
Polynomial algorithms for approximating Nash equilibria of bimatrix games. (English)
Theor. Comput. Sci. 410, No. 17, 1599-1606 (2009).
8
A game theoretic approach for efficient graph coloring. (English)
Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15‒17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 183-195 (2008).
9
Full and local information in distributed decision making. (English)
Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77917-9/pbk). Lecture Notes in Computer Science 4927, 156-169 (2008).
10
Approximations of bimatrix Nash equilibria (English)
Encyclopedia of Algorithms (2008).
11
A game theoretic approach for efficient graph coloring (English)
ISAAC, 183-195 (2008).
12
Selfish load balancing under partial knowledge. (English)
Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26‒31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 609-620 (2007).
13
Selfish load balancing under partial knowledge (English)
MFCS, 609-620 (2007).
14
Full and local information in distributed decision making (English)
WAOA, 156-169 (2007).
15
Polynomial algorithms for approximating Nash equilibria of bimatrix games. (English)
Electron. Colloq. Comput. Complex. 13, No. 081 (2006).
16
Algorithms for pure Nash equilibria in weighted congestion games. (English)
ACM J. Exp. Algorithm. 11, Spec. Iss., Article 2.7, 19 p., electronic only (2006).
17
Algorithms for pure Nash equilibria in weighted congestion games (English)
ACM Journal of Experimental Algorithmics 11 (2006).
18
Polynomial algorithms for approximating Nash equilibria of bimatrix games (English)
WINE, 286-296 (2006).
19
Efficient convergence to pure Nash equilibria in weighted network congestion games. (English)
Nikoletseas, Sotiris E. (ed.), Experimental and efficient algorithms. 4th international workshop, WEA 2005, Santorini Island, Greece, May 10‒13, 2005. Proceedings. Berlin Springer (ISBN 3-540-25920-1/pbk). Lecture Notes in Computer Science 3503, 203-215 (2005).
20
Result 1 to 20 of 24 total
Start
Contact
Print
General Help
