|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Tobias Harks, Max Klimm, Rolf H. Möhring |
Strong Nash Equilibria in Games with the Lexicographical Improvement Property  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tobias Harks, Max Klimm, Rolf H. Möhring |
Strong Nash Equilibria in Games with the Lexicographical Improvement Property.  |
WINE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Steve Chien, Alistair Sinclair |
Strong and Pareto Price of Anarchy in Congestion Games.  |
ICALP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Schockaert, Jeroen Janssen, Dirk Vermeir, Martine De Cock |
Answer Sets in a Fuzzy Equilibrium Logic.  |
RR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers |
On the value of coordination in network design.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrik Brandes, Martin Hoefer, Bobo Nick |
Network Creation Games with Disconnected Equilibria.  |
WINE  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky |
Strong Price of Anarchy for Machine Load Balancing.  |
ICALP  |
2007 |
DBLP DOI BibTeX RDF |
Strong Nash equilibria, Load balancing, Game theory, Price of Anarchy |
| 1 | Gianluigi Greco, Francesco Scarcello |
Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria.  |
UAI  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Nicole Immorlica, David R. Karger, Evdokia Nikolova, Rahul Sami |
First-price path auctions.  |
ACM Conference on Electronic Commerce  |
2005 |
DBLP DOI BibTeX RDF |
first-price auctions, path auctions |
| 1 | Sang-Chul Suh |
Games implementing the stable rule of marriage problems in strong Nash equilibria.  |
Social Choice and Welfare  |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|