|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 919 occurrences of 375 keywords
|
|
|
Results
Found 1806 publication records. Showing 1806 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
124 | Richard J. Lipton, Evangelos Markakis, Aranyak Mehta |
Playing large games using simple strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003, pp. 36-41, 2003, ACM, 1-58113-679-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
nash equilibrium, probabilistic method |
116 | Dimitris Fotakis 0001, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis |
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 123-134, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
112 | Anand Bhalgat, Tanmoy Chakraborty 0001, Sanjeev Khanna |
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 73-82, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms |
111 | Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
Non-cooperative multicast and facility location games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, pp. 72-81, 2006, ACM, 1-59593-236-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
multicast game, nash equilibrium, price of anarchy, price of stability |
108 | Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis |
Extreme Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, pp. 1-20, 2003, Springer, 3-540-20216-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
107 | Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
Which Is the Worst-Case Nash Equilibrium? ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 551-561, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
107 | Martin Hoefer 0001 |
Non-Cooperative Tree Creation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(1), pp. 104-131, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximate Nash equilibrium, Connection game, Network design, Steiner tree, Price of anarchy |
101 | Vahab S. Mirrokni, Alexander Skopalik |
On the complexity of nash dynamics and sink equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 1-10, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
potential games, sink equilibria, nash equilibria |
96 | Elad Hazan, Robert Krauthgamer |
How hard is it to approximate the best Nash equilibrium? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 720-727, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
96 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Nash equilibria in graphical games on trees revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, pp. 100-109, 2006, ACM, 1-59593-236-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, nash equilibrium, graphical games |
94 | Krishnendu Chatterjee |
Nash Equilibrium for Upward-Closed Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pp. 271-286, 2006, Springer, 3-540-45458-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
94 | Yogeshwer Sharma, David P. Williamson |
Stackelberg thresholds in network routing games or the value of altruism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 93-102, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Stackelberg equilibrium, Stackelberg threshold, altruistic flow, centrally controlled flow, game theory, Nash equilibrium, price of anarchy |
93 | Ka-man Lam, Ho-fung Leung |
Existence of Risk Strategy Equilibrium in Games Having No Pure Strategy Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIMA ![In: Agent Computing and Multi-Agent Systems, 10th Pacific Rim International Conference on Multi-Agents, PRIMA 2007, Bangkok, Thailand, November 21-23, 2007. Revised Papers, pp. 1-12, 2007, Springer, 978-3-642-01638-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
93 | Tim Roughgarden |
How unfair is optimal routing? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 203-204, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
93 | Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis |
A Network Game with Attackers and a Defender. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(3), pp. 315-341, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Attacks and defenses, Security, Game theory, Graph theory, Nash equilibria |
92 | Grant Schoenebeck, Salil P. Vadhan |
The computational complexity of nash equilibria in concisely represented games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, pp. 270-279, 2006, ACM, 1-59593-236-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
circuit games, concise games, graph games, nash equilibrium, computational game theory |
86 | Samee Ullah Khan, Ishfaq Ahmad |
A Pure Nash Equilibrium-Based Game Theoretical Method for Data Replication across Multiple Servers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 21(4), pp. 537-553, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
86 | Joseph Y. Halpern |
Beyond Nash Equilibrium: Solution Concepts for the 21st Century. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, pp. 1, 2008, Springer, 978-3-540-85360-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
86 | Samee Ullah Khan, Ishfaq Ahmad |
A Pure Nash Equilibrium Guaranteeing Game Theoretical Replica Allocation Method for Reducing Web Access Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (1) ![In: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, July 12-15, 2006, pp. 169-176, 2006, IEEE Computer Society, 0-7695-2612-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
86 | Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
Non-Cooperative Multicast and Facility Location Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 25(6), pp. 1193-1206, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
85 | Jinwu Gao, Yankui Liu |
Stochastic Nash Equilibrium with a Numerical Solution Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2005, Second International Symposium on Neural Networks, Chongqing, China, May 30 - June 1, 2005, Proceedings, Part I, pp. 811-816, 2005, Springer, 3-540-25912-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
decentralized decision system, genetic algorithm, neural network, Nash equilibrium, stochastic programming |
85 | Takashi Matsuhisa |
Communication Leading to Nash Equilibrium without Acyclic Condition (S4-Knowledge Model Case). ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part IV, pp. 884-891, 2004, Springer, 3-540-22129-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Modal logic S4, Mutual learning, Non-corporative game, Communication, Protocol, Nash equilibrium, Knowledge, Information, Conjecture |
85 | Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou |
The complexity of computing a Nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 52(2), pp. 89-97, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
85 | Dusit Niyato, Ekram Hossain 0001 |
Competitive Pricing for Spectrum Sharing in Cognitive Radio Networks: Dynamic Game, Inefficiency of Nash Equilibrium, and Collusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 26(1), pp. 192-202, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
83 | Lucas Agussurja, Hoong Chuin Lau |
The Price of Stability in Selfish Scheduling Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAT ![In: Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Silicon Valley, CA, USA, November 2-5, 2007, pp. 305-311, 2007, IEEE Computer Society, 0-7695-3027-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
83 | Ho-Lin Chen, Tim Roughgarden |
Network design with weighted players. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 29-38, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
network design, network games, nash equilibria, price of stability |
82 | Stephan J. Eidenbenz, V. S. Anil Kumar 0001, Sibylle Zust |
Equilibria in topology control games for ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, San Diego, CA, USA, September 19, 2003, pp. 2-11, 2003, ACM. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
ad hoc networks, game theory, nash equilibrium, topology control |
82 | Juliane Dunkel, Andreas S. Schulz |
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings, pp. 62-73, 2006, Springer, 3-540-68138-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
80 | Kim Thang Nguyen |
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pp. 413-424, 2009, Springer, 978-3-540-95890-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Nash equilibrium, hardness |
78 | Xin Ai 0002, Vikram Srinivasan, Chen-Khong Tham |
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 26(7), pp. 1170-1182, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
78 | Michael L. Littman, Peter Stone |
A polynomial-time nash equilibrium algorithm for repeated games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003, pp. 48-54, 2003, ACM, 1-58113-679-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
nash equilibrium, complexity analysis, repeated games, computational game theory |
76 | Rainer Feldmann, Martin Gairing, Thomas Lücking 0001, Burkhard Monien, Manuel Rode |
Nashification and the Coordination Ratio for a Selfish Routing Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 514-526, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
74 | Krishnendu Chatterjee |
Two-Player Nonzero-Sum omega-Regular Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, pp. 413-427, 2005, Springer, 3-540-28309-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
73 | Sergiu Hart, Yishay Mansour |
The communication complexity of uncoupled nash equilibrium procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 345-353, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
communication complexity, computational game theory |
72 | Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou |
The complexity of computing a Nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 71-78, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, complexity, game theory, Nash equilibrium |
72 | Takashi Matsuhisa, Paul Strokan |
Bayesian Communication Leading to a Nash Equilibrium in Belief. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings, pp. 299-306, 2005, Springer, 3-540-30900-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
p-Belief system, Bayesian communication, Non-corporative game, Protocol, Nash equilibrium, Conjecture |
72 | Takashi Matsuhisa |
p-Belief Communication Leading to a Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Computational and Information Science, First International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004, Proceedings, pp. 1114-1120, 2004, Springer, 3-540-24127-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
p-Belief system, Non-corporative game, Communication, Protocol, Nash equilibrium, Conjecture |
71 | Constantinos Daskalakis, Christos H. Papadimitriou |
On oblivious PTAS's for nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 75-84, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
anonymous games, oblivious algorithms, PTAS, bimatrix games |
71 | William E. Walsh, David C. Parkes, Rajarshi Das |
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMEC ![In: Agent-Mediated Electronic Commerce V, Designing Mechanisms and Systems, AAMAS 2003 Workshop, AMEC 2003, Melbourne, Australia, July 15, 2003, Revised Selected Papers, pp. 109-123, 2003, Springer, 3-540-22674-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
71 | Juncheng Jia, Qian Zhang 0001 |
Competitions and dynamics of duopoly wireless service providers in dynamic spectrum market. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, pp. 313-322, 2008, ACM, 978-1-60558-073-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dynamic spectrum market, non-cooperative 2-stage game, wireless service provider, nash equilibrium, dynamic spectrum access |
70 | Ho-Lin Chen, Tim Roughgarden |
Network Design with Weighted Players. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 302-324, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Network design, Algorithmic game theory, Price of stability |
70 | Martin Gairing, Burkhard Monien, Karsten Tiemann |
Selfish routing with incomplete information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 203-212, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
coordination ratio, incomplete information, nash equilibria, selfish routing, bayesian game |
69 | Renato D. Gomes, Kane S. Sweeney |
Bayes-nash equilibria of the generalized second price auction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 107-108, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bayes-nash equilibrium, generalized second price auction, position auctions, sponsored search, click-through rates |
68 | Christos H. Papadimitriou |
Recent Developments in Equilibria Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings, pp. 1-2, 2005, Springer, 3-540-30900-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
68 | Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 645-657, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
67 | Vincent Conitzer, Tuomas Sandholm |
A technique for reducing normal-form games to compute a Nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 537-544, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
computing nash equilibria, game theory, preprocessing |
67 | Michael Ummels |
The Complexity of Nash Equilibria in Infinite Multiplayer Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 20-34, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
67 | Dimitris Fotakis 0001, Paul G. Spirakis |
Cost-Balancing Tolls for Atomic Network Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, pp. 179-190, 2007, Springer, 978-3-540-77104-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
67 | Jun Sun 0007, Eytan H. Modiano, Lizhong Zheng |
Wireless channel allocation using an auction algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 24(5), pp. 1085-1096, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
67 | Elliot Anshelevich, Anirban Dasgupta 0001, Éva Tardos, Tom Wexler |
Near-optimal network design with selfish agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 511-520, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
network design, price of anarchy |
65 | Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
Maximum-lifetime routing: system optimization & game-theoretic perspectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, Montreal, Quebec, Canada, September 9-14, 2007, pp. 160-169, 2007, ACM, 978-1-59593-684-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
anycast game, multicast game, nash equilibrium, price of anarchy, price of stability |
65 | Li-ming Wang, Yang Bai |
Exploiting Based Pre-testing in Competition Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIMA ![In: Agent Computing and Multi-Agent Systems, 9th Pacific Rim International Workshop on Multi-Agents, PRIMA 2006, Guilin, China, August 7-8, 2006, Proceedings, pp. 269-278, 2006, Springer, 3-540-36707-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Game Theory, Reinforcement Learning, Nash Equilibrium, Competition, Exploiter |
65 | Sarah Koskie, Zoran Gajic |
A Nash game algorithm for SIR-based power control in 3G wireless CDMA networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(5), pp. 1017-1026, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
wireless communications, power control, Nash equilibrium, CSMA-CD, noncooperative games |
65 | Steve Chien, Alistair Sinclair |
Convergence to approximate Nash equilibria in congestion games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 169-178, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
64 | Tim Roughgarden |
Intrinsic robustness of the price of anarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 513-522, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
regret-minimizat, price of anarchy, nash equilibria, congestion games |
64 | Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski |
On Nash Equilibria in Stochastic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, pp. 26-40, 2004, Springer, 3-540-23024-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
64 | Thomas Boulogne, Eitan Altman, Odile Pourtallier |
On the Convergence to Nash Equilibrium in Problems of Distributed Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 109(1-4), pp. 279-291, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
stability of equilibrium, load balancing, networks, game theory, Nash equilibrium |
63 | Sevan G. Ficici, Ofer Melnik, Jordan B. Pollack |
A game-theoretic and dynamical-systems analysis of selection methods in coevolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 9(6), pp. 580-602, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
62 | Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev |
Alpha-Fair Resource Allocation under Incomplete Information and Presence of a Jammer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NET-COOP ![In: Network Control and Optimization, Third Euro-NF Conference, NET-COOP 2009, Eindhoven, The Netherlands, November 23-25, 2009, Proceedings, pp. 219-233, 2009, Springer, 978-3-642-10405-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Wireless networks, Power Control, Nash Equilibrium, Incomplete Information, Saddle Point |
62 | Rahul Savani, Bernhard von Stengel |
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 258-267, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
61 | Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou |
The myth of the folk theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 365-372, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
folk theorem, ppad, nash equilibrium |
61 | Frans A. Oliehoek, Edwin D. de Jong, Nikos Vlassis |
The parallel Nash Memory for asymmetric games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 337-344, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Nash Memory, coevolution archive, monotonic progress, game theory, Nash equilibrium, coevolution |
61 | Paul W. Goldberg |
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 131-140, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
agent-based computing, nash equilibrium |
61 | John Wu |
Correlated Equilibrium of Bertrand Competition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 166-177, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Equilibrium coarsenings, equilibrium refinements, strategic correlation principle, positive correlated equilibrium, negative correlated equilibrium, duality gap |
61 | Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye 0001 |
Leontief economies encode nonzero sum two-player games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 659-667, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
61 | Burkhard Monien |
Selfish Routing in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings, pp. 61-62, 2006, Springer, 3-540-31198-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Rainer Feldmann, Marios Mavronicolas, Andreas Pieris |
Facets of the Fully Mixed Nash Equilibrium Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings, pp. 145-157, 2008, Springer, 978-3-540-79308-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev |
Transmission Power Control Game with SINR as Objective Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NET-COOP ![In: Network Control and Optimization, Second Euro-NF Workshop, NET-COOP 2008, Paris, France, September 8-10, 2008. Revised Selected Papers, pp. 112-120, 2008, Springer, 978-3-642-00392-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Wireless networks, Cooperation, Power Control, Nash Equilibrium |
60 | Weizhao Wang, Xiang-Yang Li 0001, Stephan J. Eidenbenz, Yu Wang 0003 |
OURS: optimal unicast routing systems in non-cooperative wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006, Los Angeles, CA, USA, September 23-29, 2006, pp. 402-413, 2006, ACM, 1-59593-286-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
frugality ratio, non-cooperative, wireless networks, game theory, mechanism design, nash equilibrium, dominant strategy |
60 | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano |
How to route and tax selfish unsplittable traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 196-205, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
scheduling, nash equilibrium, selfish routing, algorithmic mechanism design |
59 | Stéphane Airiau, Sandip Sen |
Learning Pareto-optimal Solutions in 2x2 Conflict Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAMAS ![In: Learning and Adaption in Multi-Agent Systems, First International Workshop, LAMAS 2005, Utrecht, The Netherlands, July 25, 2005, Revised Selected Papers, pp. 86-99, 2005, Springer, 3-540-33053-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
59 | Sandip Sen, Stéphane Airiau, Rajatish Mukherjee |
Towards a pareto-optimal solution in general-sum games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The Second International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2003, July 14-18, 2003, Melbourne, Victoria, Australia, Proceedings, pp. 153-160, 2003, ACM, 1-58113-683-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
strategy revelation, agents, game playing |
59 | Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando |
On solving generalized Nash equilibrium problems via optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(3), pp. 419-435, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Generalized Nash equilibrium problem, Nikaido-Isoda function, Descent method |
59 | Ramin Rajabioun, Esmaeil Atashpaz-Gargari, Caro Lucas |
Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part II, pp. 680-695, 2008, Springer, 978-3-540-69840-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Colonial Competitive Algorithm (CCA), global Nash Equilibrium, evolutionary algorithms, game theory |
59 | Eyal Even-Dar, Alexander Kesselman, Yishay Mansour |
Convergence time to Nash equilibrium in load balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 32, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
game theory, Nash equilibrium, convergence time |
59 | Takashi Matsuhisa |
Communication Leading to Nash Equilibrium Through Robust Messages - S5 -Knowledge Model Case -. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 136-145, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Robust message, Non-corporative game, S5-knowledge model, Communication, Protocol, Nash equilibrium, Conjecture |
58 | Yuichi Yabu, Makoto Yokoo, Atsushi Iwasaki |
Multiagent Planning with Trembling-Hand Perfect Equilibrium in Multiagent POMDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIMA ![In: Agent Computing and Multi-Agent Systems, 10th Pacific Rim International Conference on Multi-Agents, PRIMA 2007, Bangkok, Thailand, November 21-23, 2007. Revised Papers, pp. 13-24, 2007, Springer, 978-3-642-01638-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Trembling-hand perfect equilibrium, Multiagent systems, Nash equilibrium, Partially Observable Markov Decision Process |
58 | Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle |
Publish and perish: definition and analysis of an n-person publication impact game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 11-18, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
timing games, nash equilibrium, numerical algorithms |
58 | Luiz Augusto N. Barroso, Marcia Helena Costa Fampa, Rafael Kelman, Mario V. F. Pereira, Priscila Lino |
Market Power Issues in Bid-Based Hydrothermal Dispatch. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 117(1-4), pp. 247-270, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hydrothermal scheduling, market power, Cournot-Nash equilibrium, game theory, stochastic optimization |
55 | Dario Bauso, Laura Giarré, Raffaele Pesenti |
Noncooperative dynamic games for inventory applications: A consensus approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 4819-4824, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
55 | Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty |
On nash equilibria for a network creation game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 89-98, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Xi Chen 0001, Xiaotie Deng, Shang-Hua Teng |
Computing Nash Equilibria: Approximation and Smoothed Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 603-612, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Michal Penn, Maria Polukarov, Moshe Tennenholtz |
Congestion games with failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5-8, 2005, pp. 259-268, 2005, ACM, 1-59593-049-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pure-strategy nash, failures, equilibrium, congestion games |
54 | Natalia Akchurina |
Multiagent reinforcement learning: algorithm converging to Nash equilibrium in general-sum discounted stochastic games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (2) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 2, pp. 725-732, 2009, IFAAMAS, 978-0-9817381-7-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
computation of equilibria, multiagent reinforcement learning, algorithmic game theory, stochastic games |
54 | Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 |
Symmetries and the Complexity of Pure Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 212-223, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Edward P. Manning |
Coevolution in a large search space using resource-limited nash memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 999-1006, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
games, nash equilibrium, coevolution, evaluation function |
54 | Xi Chen 0001, Xiaotie Deng, Shang-Hua Teng |
Settling the complexity of computing two-player Nash equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(3), pp. 14:1-14:57, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Arrow-Debreu market, Brouwer's fixed point, Lemke-Howson algorithm, PPAD-completeness, Sperner's lemma, Nash equilibrium, smoothed analysis, Two-player game |
53 | Dong Zheng 0004, Weiyan Ge, Junshan Zhang |
Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(1), pp. 205-222, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
53 | Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli |
On Nash equilibria for multicast transmissions in ad-hoc wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 14(2), pp. 147-157, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cost sharing methods, Energy saving, Price of anarchy, Nash equilibria |
53 | Panagiota N. Panagopoulou, Paul G. Spirakis |
A Game Theoretic Approach for Efficient Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 183-195, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
53 | Martin Gairing |
Malicious Bayesian Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers, pp. 119-132, 2008, Springer, 978-3-540-93979-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
53 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Computing good nash equilibria in graphical games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 162-171, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation scheme, graphical games |
53 | Martin Hoefer 0001 |
Non-cooperative Tree Creation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 517-527, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Hui Yu, Jian Chen, Caihong Sun |
N-Person Noncooperative Game with Infinite Strategic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 77-84, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli |
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 172-183, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
53 | Tim Roughgarden |
The price of anarchy is independent of the network topology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 428-437, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
53 | Nobuo Suematsu, Akira Hayashi |
A multiagent reinforcement learning algorithm using extended optimal response. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The First International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2002, July 15-19, 2002, Bologna, Italy, Proceedings, pp. 370-377, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Markov games, reinforcement learning, Q-learning, stochastic games |
52 | Ishai Menache, Nahum Shimkin |
Efficient Rate-Constrained Nash Equilibrium in Collision Channels with State Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 403-411, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Min Jiang |
Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 483-494, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Hanyang Quek, Chunghoong Woo, Kay Chen Tan, Arthur Tay |
Evolving Nash-optimal poker strategies using evolutionary computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. China ![In: Frontiers Comput. Sci. China 3(1), pp. 73-91, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary algorithm, game theory, Nash equilibrium, poker |
Displaying result #1 - #100 of 1806 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|