Learn More
We define trust-based mechanism design as an augmentation of traditional mechanism design in which agents take into account the degree of trust that they have in their counterparts when determining their allocations. To this end, we develop an efficient, individually rational, and incentive compatible mechanism based on trust. This mechanism is embedded in(More)
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing wide-area 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)
Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive compatible, direct mechanisms that are efficient (i.e., max-imise social utility) and individually rational (i.e., agents prefer to join rather than opt out). However , an important assumption of these mechanisms is that the(More)
— This paper reports on the design and comparison of two economically-inspired mechanisms for task allocation in environments where sellers have finite production capacities and a cost structure composed of a fixed overhead cost and a constant marginal cost. Such mechanisms are required when a system consists of multiple self-interested stakeholders that(More)
This paper reports on the development of a utility-based mechanism for managing sensing and communication in cooperative multi-sensor networks. The specific application considered is that of GLACSWEB, a deployed system that uses battery-powered sensors to collect environmental data related to glaciers which it transmits back to a base station so that it can(More)
In many dynamic open systems, agents have to interact with one another to achieve their goals. Here, agents may be self-interested, and when trusted to perform an action for others, may betray that trust by not performing the actions as required. In addition, due to the size of such systems, agents will often interact with other agents with which they have(More)
Conventional information fusion architectures are challenged by developments in sensor networks that allow individually-owned (and thereby selfish) sensors to interact and share data. Given this, we advocate the use of tools and techniques from computational mechanism design, a field at the intersection of computer science, game theory and economics, to(More)
We develop a novel bidding strategy that software agents can use to buy and sell goods in Continuous Double Auctions (CDAs). Our strategy involves the agent forming a bid or ask by assessing the degree of risk involved and making a prediction about the competitive equilibrium that is likely to be reached in the marketplace. We benchmark our strategy against(More)
In this paper, we present our investigation into the use of a team of players within a noisy Iterated Prisoner's Dilemma (IPD) tournament. We show that the members of such a team are able to use a prearranged sequence of moves that they make at the start of each interaction in order to recognise one another, and that by coordinating their actions they can(More)