Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
36
search results - page 8 / 8
»
Polynomial-time Algorithms from Ineffective Proofs
Sort
relevance
views
votes
recent
update
View
thumb
title
15
click to vote
ATAL
2010
Springer
140
views
Intelligent Agents
»
more
ATAL 2010
»
Pure Nash equilibria: complete characterization of hard and easy graphical games
13 years 5 months ago
Download
people.cs.ubc.ca
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
claim paper
Read More »
« Prev
« First
page 8 / 8
Last »
Next »