15033 search results - page 247 / 3007 » Complexity Theory and Algorithms |
249
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
191
click to vote
SIGECOM
2005
ACM
16 years 23 days ago
2005
ACM
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
202
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
196
click to vote
FUIN
2007
15 years 7 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
215
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...