2446 search results - page 137 / 490 » Choiceless Polynomial Time |
153
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
143
click to vote
LPNMR
2001
Springer
15 years 8 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
139
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
147
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...
201
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...