Searched for:
(1 - 10 of 10)
document
De Weerdt, M.M. (author), Zhang, Y. (author), Klos, T. (author)
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NP-complete. Moreover, it is not approximable within some factor. In contrast to this, we develop an efficient greedy...
journal article 2011
document
De Weerdt, M.M. (author), Zhang, Y. (author)
In games where agents are asked to declare their available resources, they can also strategize over this declaration. Surprisingly, not in all such games a VCG payment can be applied to construct a truthful mechanism using an optimal algorithm, though such payments can prevent under-reporting of resources. We show this for the problem of...
book chapter 2010
document
Wu, M. (author), De Weerdt, M.M. (author), La Poutré, H. (author), Yadati, C. (author), Zhang, Y. (author), Witteveen, C. (author)
conference paper 2009
document
Zhang, Y. (author), De Weerdt, M.M. (author)
When information or control in a multiagent system is private to the agents, they may misreport this information or refuse to execute an agreed outcome, in order to change the resulting end state of such a system to their benefit. This may result in execution failures. When only information is private, mechanisms such as VCG use payments to...
conference paper 2009
document
Zhang, Y. (author), De Weerdt, M.M. (author)
When information or control in a multiagent system is private to the agents, they may misreport this information or refuse to execute an agreed outcome, in order to change the resulting end state of such a system to their benefit. In some domains this may result in an execution failure. We show that in such settings VCG mechanisms lose...
conference paper 2009
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author), Zhang, Y. (author)
conference paper 2008
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author), Zhang, Y. (author)
Multiagent planning methods are concerned with planning by and for a group of agents. If the agents are selfinterested, they may be tempted to lie in order to obtain an outcome that is more rewarding for them. We therefore study the multiagent planning problem from a mechanism design perspective, showing how to incentivise agents to be truthful....
conference paper 2008
document
Zhang, Y. (author), De Weerdt, M.M. (author)
In many applications of the task allocation problem such as peer-topeer and grid computing, and virtual organizations, the (social or business) relations between the participating agents play an important role, and thus they should be taken into account. Furthermore, in such applications, agents providing the resources usually act self...
conference paper 2007
document
De Weerdt, M.M. (author), Zhang, Y. (author), Klos, T. (author)
Full paper is published in: Proceedings Autonomous Agents and Multi-Agent Systems (AAMAS), 2007
conference paper 2007
document
De Weerdt, M.M. (author), Zhang, Y. (author), Klos, T. (author)
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NPhard. Moreover, it is not approximable within some factor. We develop an algorithm based on the contract-net...
conference paper 2007
Searched for:
(1 - 10 of 10)