2957 search results - page 504 / 592 » The Complexity of Polynomial-Time Approximation |
AAAI
2007
13 years 10 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
AIPS
2008
13 years 10 months ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...