159 search results - page 17 / 32 » Computational Complexity of Fundamental Problems in Social C... |
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
112
click to vote
HIPC
2005
Springer
15 years 5 months ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
100
click to vote
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
AAAI
2006
15 years 1 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...