Nathanael Hyafil

Learn More
A CSP based algorithm for the conformant probabilistic planning problem (CPP) has been presented by Hyafil & Bacchus. Although their algorithm displayed some interesting potential when compared with traditional POMDP algorithms, it was developed using a " flat " representation. In this work we revisit this algorithm and develop a version that utilizes a(More)
Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is not known by other agents, nor is it known by the mechanism designer. When this uncertainty is quantified prob-abilistically, a mechanism induces a game of incomplete information(More)
  • 1