scispace - formally typeset
Search or ask a question

Showing papers by "Dengji Zhao published in 2016"


Proceedings Article
09 Jul 2016
TL;DR: This paper studies a search problem involving a robot that is searching for a certain item in an uncertain environment that allows only limited interaction with humans and shows that this search problem is polynomially solvable with a novel integration of the human help.
Abstract: This paper studies a search problem involving a robot that is searching for a certain item in an uncertain environment (e.g., searching minerals on Moon) that allows only limited interaction with humans. The uncertainty of the environment comes from the rewards of undiscovered items and the availability of costly human help. The goal of the robot is to maximize the reward of the items found while minimising the search costs. We show that this search problem is polynomially solvable with a novel integration of the human help, which has not been studied in the literature before. Furthermore, we empirically evaluate our solution with simulations and show that it significantly outperforms several benchmark approaches.

7 citations


Proceedings ArticleDOI
09 May 2016
TL;DR: A general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them, is studied and it is shown that the post-execution verification (PEV) mechanism is applicable if and only if agents' valuations are risk-neutral.
Abstract: We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). The goal is to choose an allocation that maximises social welfare while taking their execution uncertainty into account (i.e., fault tolerant). To achieve this, we show that the post-execution verification (PEV)-based mechanism presented by Porter et al. (2008) is applicable if and only if agents' valuations are risk-neutral (i.e., the solution is almost universal). We then consider a more advanced setting where an agent's execution uncertainty is not completely predictable by the agent alone but aggregated from all agents' private opinions (known as trust). We show that PEV-based mechanism with trust is still applicable if and only if the trust aggregation is multilinear. Given this characterisation, we further demonstrate how this mechanism can be successfully applied in a real-world setting. Finally, we draw the parallels between our results and the literature of efficient mechanism design with general interdependent valuations.

6 citations