Viet Dung Dang

Learn More
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent systems. When effective, such coalitions can improve the performance of the individual agents and/or of the system as a whole. However, one of the main problems that hinders the wide(More)
The increasing number of online auctions poses a big challenge to e-consumers, especially to those who are actively looking for good deals. In this paper, we present the design of an autonomous agent that can alleviate some of these problems by participating across multiple online auctions (in particular, English, Dutch, and Vickrey auctions). The agent(More)
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithm for coalition structure generation that is faster than previous anytime(More)
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions(More)
Virtual organisations (VOs) are composed of a number of individuals, departments or organisations each of which has a range of capabilities and resources at their disposal. These VOs are formed so that resources may be pooled and services combined with a view to exploiting a perceived market niche. However, in the modern commercial environment it is(More)
This paper develops new algorithms for clearing multiunit single-item and multi-unit combinatorial reverse auctions. Specifically, we consider settings where bids are submitted in the form of a supply function and the auctions have sub-additive pricing with free disposal. Our algorithms are based on a greedy strategy and we show that they are of polynomial(More)
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an instance of coalition formation, with overlapping coalitions. We show that within this application area sub-additive coalition valuations are typical, and we thus use this(More)