Arrow Research search

Author name cluster

Peter McBurney

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

59 papers
2 author rows

Possible papers

59

JAAMAS Journal 2026 Journal Article

A Dialogue Game Protocol for Agent Purchase Negotiations

  • Peter McBurney
  • Rogier M. van Eijk
  • Leila Amgoud

Abstract We propose a dialogue game protocol for purchase negotiation dialogues which identifies appropriate speech acts, defines constraints on their utterances, and specifies the different sub-tasks agents need to perform in order to engage in dialogues according to this protocol. Our formalism combines a dialogue game similar to those in the philosophy of argumentation with a model of rational consumer purchase decision behaviour adopted from marketing theory. In addition to the dialogue game protocol, we present a portfolio of decision mechanisms for the participating agents engaged in the dialogue and use these to provide our formalism with an operational semantics. We show that these decision mechanisms are sufficient to generate automated purchase decision dialogues between autonomous software agents interacting according to our proposed dialogue game protocol.

JAAMAS Journal 2026 Journal Article

A Dialogue Game Protocol for Multi-Agent Argument over Proposals for Action

  • Katie Atkinson
  • Trevor Bench-Capon
  • Peter McBurney

We present the syntax and semantics for a multi-agent dialogue game protocol which permits argument over proposals for action. The protocol, called the Persuasive Argument for Multiple Agents (PARMA) Protocol, embodies an earlier theory by the authors of persuasion over action which enables participants to rationally propose, attack, and defend, an action or course of actions (or inaction). We present an outline of both an axiomatic and a denotational semantics, and discuss implementation of the protocol, in the context of both human and artificial agents.

JAAMAS Journal 2026 Journal Article

A Manifesto for Agent Technology: Towards Next Generation Computing

  • Michael Luck
  • Peter McBurney
  • CHRIS PREIST

Abstract The European Commission's eEurope initiative aims to bring every citizen, home, school, business and administration online to create a digitally literate Europe. The value lies not in the objective itself, but in its ability to facilitate the advance of Europe into new ways of living and working. Just as in the first literacy revolution, our lives will change in ways never imagined. The vision of eEurope is underpinned by a technological infrastructure that is now taken for granted. Yet it provides us with the ability to pioneer radical new ways of doing business, of undertaking science, and, of managing our everyday activities. Key to this step change is the development of appropriate mechanisms to automate and improve existing tasks, to anticipate desired actions on our behalf (as human users) and to undertake them, while at the same time enabling us to stay involved and retain as much control as required. For many, these mechanisms are now being realised by agent technologies, which are already providing dramatic and sustained benefits in several business and industry domains, including B2B exchanges, supply chain management, car manufacturing, and so on. While there are many real successes of agent technologies to report, there is still much to be done in research and development for the full benefits to be achieved. This is especially true in the context of environments of pervasive computing devices that are envisaged in coming years. This paper describes the current state-of-the-art of agent technologies and identifies trends and challenges that will need to be addressed over the next 10 years to progress the field and realise the benefits. It offers a roadmap that is the result of discussions among participants from over 150 organisations including universities, research institutions, large multinational corporations and smaller IT start-up companies. The roadmap identifies successes and challenges, and points to future possibilities and demands; agent technologies are fundamental to the realisation of next generation computing.

IJCAI Conference 2024 Conference Paper

Learning Translations: Emergent Communication Pretraining for Cooperative Language Acquisition

  • Dylan Cope
  • Peter McBurney

In Emergent Communication (EC) agents learn to communicate with one another, but the protocols that they develop are specialised to their training community. This observation led to research into Zero-Shot Coordination (ZSC) for learning communication strategies that are robust to agents not encountered during training. However, ZSC typically assumes that no prior data is available about the agents that will be encountered in the zero-shot setting. In many cases, this presents an unnecessarily hard problem and rules out communication via preestablished conventions. We propose a novel AI challenge called a Cooperative Language Acquisition Problem (CLAP) in which the ZSC assumptions are relaxed by allowing a 'joiner' agent to learn from a dataset of interactions between agents in a target community. We propose and compare two methods for solving CLAPs: Behaviour Cloning (BC), and Emergent Communication pretraining and Translation Learning (ECTL), in which an agent is trained in self-play with EC and then learns to translate between an emergent protocol and the target community's protocol.

ECAI Conference 2024 Conference Paper

The Propensity for Density in Feed-Forward Models

  • Nandi Schoots
  • Alex Jackson
  • Ali Kholmovia
  • Peter McBurney
  • Murray Shanahan

Does the process of training a neural network to solve a task tend to use all of the available weights even when the task could be solved with fewer weights? To address this question we study the effects of pruning fully connected, convolutional and residual models while varying their widths. We find that the proportion of weights that can be pruned without degrading performance is largely invariant to model size. Increasing the width of a model has little effect on the density of the pruned model relative to the increase in absolute size of the pruned network. In particular, we find substantial prunability across a large range of model sizes, where our biggest model is 50 times as wide as our smallest model. We explore three hypotheses that could explain these findings. Source code: [29].

AAMAS Conference 2022 Conference Paper

Towards an Enthymeme-Based Communication Framework

  • Alison R. Panisson
  • Peter McBurney
  • Rafael H. Bordini

In this work, we give an operational semantics for speech acts that BDI agents can use to communicate enthymemes. The approach uses argumentation schemes as common organisational knowledge to guide the construction of enthymemes by the proponents of arguments. Such schemes are also used to guide the reconstruction of the intended argument by the recipients of such enthymemes.

KR Conference 2022 Conference Paper

Towards an Enthymeme-Based Communication Framework in Multi-Agent Systems

  • Alison R. Panisson
  • Peter McBurney
  • Rafael H. Bordini

Communication is one of the most important aspects of multi-agent systems. Among the different communication techniques applied to multi-agent systems, argumentation-based approaches have received special interest from the community, because allowing agents to exchange arguments provides a rich form of communication. In contrast to the benefits that argumentation-based techniques provide to multi-agent communication, extra weight on the communication infrastructure results from the additional information exchanged by agents, which could restrict the practical use of such techniques. In this work, we propose an argumentation framework whereby agents are able to exchange shorter messages when engaging in dialogues by omitting information that is common knowledge (e. g. , information about a shared multi-agent organisation). In particular, we focus on using enthymemes, shared argumentation schemes (i. e. , reasoning patterns from which arguments are instantiated), and common organisational knowledge to build an enthymeme-based communication framework. We show that our approach addresses some of Grice's maxims, in particular that agents can be brief in communication, without any loss in the content of the intended arguments.

FLAP Journal 2021 Journal Article

Argument Schemes and Dialogue Protocols: Doug Walton's Legacy in Artificial Intelligence.

  • Peter McBurney
  • Simon Parsons

This paper is intended to honour the memory of Douglas Walton (1942–2020), a Canadian philosopher of argumentation who died in January 2020. Walton’s contributions to argumentation theory have had a very strong influence on Artificial Intelligence (ai), particularly in the design of autonomous software agents able to reason and argue with one another, and in the design of protocols to govern such interactions. In this paper, we explore two of these contributions — argumentation schemes and dialogue protocols — by discussing how they may be applied to a pressing current research challenge in ai: the automated assessment of explanations for automated decision-making systems.

AAAI Conference 2021 Conference Paper

The Influence of Memory in Multi-Agent Consensus

  • David Kohan Marzagão
  • Luciana Basualdo Bonatto
  • Tiago Madeira
  • Marcelo Matheus Gauy
  • Peter McBurney

Multi-agent consensus problems can often be seen as a sequence of autonomous and independent local choices between a finite set of decision options, with each local choice undertaken simultaneously, and with a shared goal of achieving a global consensus state. Being able to estimate probabilities for the different outcomes and to predict how long it takes for a consensus to be formed, if ever, are core issues for such protocols. Little attention has been given to protocols in which agents can remember past or outdated states. In this paper, we propose a framework to study what we call memory consensus protocol. We show that the employment of memory allows such processes to always converge, as well as, in some scenarios, such as cycles, converge faster. We provide a theoretical analysis of the probability of each option eventually winning such processes based on the initial opinions expressed by agents. Further, we perform experiments to investigate network topologies in which agents benefit from memory on the expected time needed for consensus.

AAMAS Conference 2019 Conference Paper

Deploying a Shareholder Rights Management System onto a Distributed Ledger

  • Luke Riley
  • Grammateia Kotsialou
  • Amrita Dhillon
  • Toktam Mahmoodi
  • Peter McBurney
  • Richard Pearce

This work demonstrates how a multi-company shareholder rights management system has been implemented using Distributed Ledger Technology (DLT). In this demo1, we use a permissioned blockchain to store our corporate data, such as the list of all registered companies, each company’s shareholders and how many shares everyone holds. It is assumed that the nodes of the blockchain are controlled by the main stakeholder agents but we show that users who do not run a node can still use multiple websites to access company information. On top of this, we show our system can be used to allow any shareholder to participate in elections for company matters. Lastly, we describe how we designed our system’s architecture so that it could be implemented even on a public blockchain.

AAMAS Conference 2018 Conference Paper

Using Distributed Ledger Technology for Shareholder Rights Management

  • Grammateia Kotsialou
  • Luke Riley
  • Amrita Dhillon
  • Toktam Mahmoodi
  • Peter McBurney
  • Paul Massey
  • Richard Pearce

We study and develop an automated platform for shareholder rights management using Distributed Ledger Technology (DLT), in collaboration with an equity crowdfunding company. DLT has high impact potential for the multi-agent systems domain, as it allows participants to agree on the values of shared variables and keep a history of how the values change over time. DLT also enables participants to know that the shared values are common knowledge. In our application, the shared variables that the agents agree on are the shareholder rights. Knowing that there is common agreement on these rights allows us to develop related applications, such as a shareholder voting system. In this paper, we discuss the shareholder rights management platform and briefly mention a related shareholder voting system, both currently under development.

KER Journal 2017 Journal Article

Engineering the emergence of norms: a review

  • Chris Haynes
  • Michael Luck
  • Peter McBurney
  • Samhar Mahmoud
  • Tomáš Vítek
  • Simon Miles

Abstract Complex systems often exhibit emergent behaviour, unexpected macro-level behaviour caused by the interaction of micro-level components. In multiagent systems, these micro-level components may be autonomous agents and the emergent behaviour may be expressed as norms—patterns of behaviour that arise among the agents in response to their environment and each other. These emergent norms may be beneficial (e.g. by encouraging cooperative behaviour), or detrimental, but in either case it is useful to recognize these norms as they emerge and either encourage or discourage their establishment. We term this process engineering the emergence of norms and have identified three steps: the identification of a possible norm, evaluation of its benefit and its encouragement (or discouragement). This paper is an attempt to provide a survey of existing research related to these steps. We also provide an analysis of the approaches based upon their suitability for a variety of normative systems: we examine the requirements for agents to have autonomy over their choice of norms, the degree of observability required in the system, and the norm enforcement methods. The paper concludes with an discussion of open issues.

AAMAS Conference 2017 Conference Paper

Multi-Agent Flag Coordination Games

  • David Kohan Marzagã o
  • Nicolá s Rivera
  • Colin Cooper
  • Peter McBurney
  • Kathleen Steinhö fel

Many multi-agent coordination problems can be understood as autonomous local choices between a finite set of options, with each local choice undertaken simultaneously without explicit coordination between decision-makers, and with a shared goal of achieving a desired global state or states. Examples of such problems include classic consensus problems between nodes in a distributed computer network and the adoption of competing technology standards. We model such problems as a multi-round game between agents having flags of different colours to represent the finite choice options, and all agents seeking to achieve global patterns of colours through a succession of local colour-selection choices. We generalise and formalise the problem, proving results for the probabilities of achievement of common desired global states when these games are undertaken on bipartite graphs, extending known results for non-bipartite graphs. We also calculate probabilities for the game entering infinite cycles of non-convergence. In addition, we present a game-theoretic approach to the problem that has a mixed-strategy Nash equilibrium where two players can simultaneously flip the colour of one of the opponent’s nodes in the bipartite graph before or during a flag-coordination game.

ECAI Conference 2016 Conference Paper

Pricing Options with Portfolio-Holding Trading Agents in Direct Double Auction

  • Sarvar Abdullaev
  • Peter McBurney
  • Katarzyna Musial

Options constitute integral part of modern financial trades, and are priced according to the risk associated with buying or selling certain asset in future. Financial literature mostly concentrates on risk-neutral methods of pricing options such as Black-Scholes model. However, it is an emerging field in option pricing theory to use trading agents with utility functions to determine the option's potential payoff for the agent. In this paper, we use one of such methodologies developed by Othman and Sandholm to design portfolio-holding agents that are endowed with popular option portfolios such as bullish spread, butterfly spread, straddle, etc to price options. Agents use their portfolios to evaluate how buying or selling certain option would change their current payoff structure, and form their orders based on this information. We also simulate these agents in a multi-unit direct double auction. The emerging prices are compared to risk-neutral prices under different market conditions. Through an appropriate endowment of option portfolios to agents, we can also mimic market conditions where the population of agents are bearish, bullish, neutral or non-neutral in their beliefs.

EUMAS Conference 2014 Conference Paper

Direct Exchange Mechanisms for Option Pricing

  • Sarvar Abdullaev
  • Peter McBurney
  • Katarzyna Musial

Abstract This paper presents the design and simulation of direct exchange mechanisms for pricing European options. It extends McAfee’s single-unit double auction to multi-unit format, and then applies it for pricing options through aggregating agent predictions of future asset prices. We will also propose the design of a combinatorial exchange for the simulation of agents using option trading strategies. We present several option trading strategies that are commonly used in real option markets to minimise the risk of future loss, and assume that agents can submit them as a combinatorial bid to the market maker. We provide simulation results for proposed mechanisms, and compare them with existing Black-Scholes model mostly used for option pricing. The simulation also tests the effect of supply and demand changes on option prices. It also takes into account agents with different implied volatility. We also observe how option prices are affected by the agents’ choices of option trading strategies.

IJCAI Conference 2013 Conference Paper

Opponent Modelling in Persuasion Dialogues

  • Christos Hadjinikolis
  • Yiannis Siantos
  • Sanjay Modgil
  • Elizabeth Black
  • Peter McBurney

A strategy is used by a participant in a persuasion dialogue to select locutions most likely to achieve its objective of persuading its opponent. Such strategies often assume that the participant has a model of its opponents, which may be constructed on the basis of a participant’s accumulated dialogue experience. However in most cases the fact that an agent’s experience may encode additional information which if appropriately used could increase a strategy’s efficiency, is neglected. In this work, we rely on an agent’s experience to define a mechanism for augmenting an opponent model with information likely to be dialectally related to information already contained in it. Precise computation of this likelihood is exponential in the volume of related information. We thus describe and evaluate an approximate approach for computing these likelihoods based on Monte-Carlo simulation.

AAMAS Conference 2011 Conference Paper

Argumentation-Based Reasoning in Agents with Varying Degrees of Trust

  • Simon Parsons
  • Yuqing Tang
  • Elizabeth Sklar
  • Peter McBurney
  • Kai Cai

In any group of agents, trust plays an important role. The degree to which agents trust one another will inform what they believe, and, as a result the reasoning that they perform and the conclusions that they come to when that involves information from other agents. In this paper we consider a group of agents with varying degrees of trust of each other, and examine the combinations of trust with the argumentation-based reasoning that they can carry out. The question we seek to answer is "What is the relationship between the trust one agent has in another and the conclusions that it can draw using information from that agent? ", and show that there are a range of answers depending upon the way that the agents deal with trust.

JAAMAS Journal 2011 Journal Article

Using argumentation to model agent decision making in economic experiments

  • Trevor Bench-Capon
  • Katie Atkinson
  • Peter McBurney

Abstract In this paper we demonstrate how a qualitative framework for decision making can be used to model scenarios from experimental economic studies and we show how our approach explains the results that have been reported from such studies. Our framework is an argumentation-based one in which the social values promoted or demoted by alternative action options are explicitly represented. Our particular representation is used to model the Dictator Game and the Ultimatum Game, which are simple interactions in which it must be decided how a sum of money will be divided between the players in the games. Studies have been conducted into how humans act in such games and the results are not explained by a decision-model that assumes that the participants are purely self-interested utility-maximisers. Some studies further suggest that differences in choices made in different cultures may reflect their day to day behaviour, which can in turn be related to the values of the subjects, and how they order their values. In this paper we show how these interactions can be modelled in agent systems in a framework that makes explicit the reasons for the agents’ choices based upon their social values. Our framework is intended for use in situations where agents are required to be adaptable, for example, where agents may prefer different outcome states in transactions involving different types of counter-parties.

EUMAS Conference 2011 Conference Paper

What Are Models for?

  • Peter McBurney

Abstract In this paper I discuss some of the purposes and functions of building models, particularly agent-based models, and present a comprehensive list of these purposes and functions. Careful thought and attention is needed when modeling domains containing intelligent entities, which is usually the case for agent modeling. Reflection on the challenges involved in such domains leads me to propose the construction of meta-models, which are models of the relationship between an intended model of the domain and the entities in the domain, when the entities may have access to the intended model or its outputs. Agent-based computing approaches provide disciplined means of specifying, designing, developing and evaluating such meta-models.

AAMAS Conference 2010 Conference Paper

A Distributed Algorithm for Anytime Coalition Structure Generation

  • Tomasz Michalak
  • Jacek Sroka
  • Talal Rahwan
  • Michael Wooldridge
  • Peter McBurney
  • Nicholas R. Jennings

A major research challenge in multi-agent systems is theproblem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of thesystem is optimized. This problem is difficult because thesearch space is very large: the number of possible coalition structures increases exponentially with the number ofagents. Although several algorithms have been proposed totackle this Coalition Structure Generation (CSG) problem, all of them suffer from being inherently centralized, whichleads to the existence of a performance bottleneck and a single point of failure. In this paper, we develop the first decentralized algorithm for solving the CSG problem optimally. In our algorithm, the necessary calculations are distributedamong the agents, instead of being carried out centrally bya single agent (as is the case in all the available algorithmsin the literature). In this way, the search can be carriedout in a much faster and more robust way, and the agentscan share the burden of the calculations. The algorithmcombines, and improves upon, techniques from two existingalgorithms in the literature, namely DCVC and IP, and applies novel techniques for filtering the input and reducing the inter-agent communication load.

AAMAS Conference 2010 Conference Paper

A Logic-Based Representation for Coalitional Games with Externalities

  • Tomasz Michalak
  • Dorota Marciniak
  • Marcin Szamotulski
  • Talal Rahwan
  • Michael Wooldridge
  • Peter McBurney
  • Nicholas R. Jennings

We consider the issue of representing coalitional games in multi-agent systems that exhibit externalities from coalition formation, i. e. , systems in which the gain from forming a coalition may be affected by the formation of other co-existing coalitions. Althoughexternalities play a key role in many real-life situations, very littleattention has been given to this issue in the multi-agent system literature, especially with regard to the computational aspects involved. To this end, we propose a new representation which, in the spiritof Ieong and Shoham, is based on Boolean expressions. Theidea behind our representation is to construct much richer expressions that allow for capturing externalities induced upon coalitions. We show that the new representation is fully expressive, at least asconcise as the conventional partition function game representationand, for many games, exponentially more concise. We evaluate theefficiency of our new representation by considering the problem ofcomputing the Extended and Generalized Shapley value, a powerful extension of the conventional Shapley value to games withexternalities. We show that by using our new representation, theExtended and Generalized Shapley value, which has not been studied in the computer science literature to date, can be computed intime linear in the size of the input.

AAMAS Conference 2010 Conference Paper

Characterising and Matching Iterative and Recursive Agent Interaction Protocols

  • Tim Miller
  • Peter McBurney

For an agent to intelligently use specifications of executableprotocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is executed. In some cases, this information may be attached to the specification; however, this is not always the case. In this paper, we present an algorithm for deriving characterisations ofprotocols. These characterisations specify the preconditionsunder which the protocol can be executed, and the outcomesof this execution. The algorithm is applicable to definitionswith infinite iteration, and recursive definitions that terminate. We prove how a restricted subset of non-terminatingrecursive protocols can be characterised by rewriting theminto equivalent non-recursive definitions before characterisation. We then define a method for matching protocolsfrom their characterisations. We prove that the complexityof the matching method is less than for methods such as adepth-first search algorithm. Our experimental evaluationconfirms this.

IJCAI Conference 2009 Conference Paper

  • Talal Rahwan
  • Tomasz Michalak
  • Nicholas R. Jennings
  • Michael Wooldridge
  • Peter McBurney

Coalition structure generation has received considerable attention in recent research. Several algorithms have been proposed to solve this problem in Characteristic Function Games (CFGs), where every coalition is assumed to perform equally well in any coalition structure containing it. In contrast, very little attention has been given to the more general Partition Function Games (PFGs), where a coalition’s effectiveness may change from one coalition structure to another. In this paper, we deal with PFGs with positive and negative externalities. In this context, we identify the minimum search that is required in order to establish a bound on the quality of the best coalition structure found. We then develop an anytime algorithm that improves this bound with further search, and show that it outperforms the existing state-of-the-art algorithms by orders of magnitude.

JAAMAS Journal 2009 Journal Article

Evolutionary mechanism design: a review

  • Steve Phelps
  • Peter McBurney
  • Simon Parsons

Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of all of the components of the system in advance. Rather, we attempt to design infrastructure, such as network protocols, in such a way that the overall system is robust despite the fact that numerous arbitrary, non-certified, third-party components can connect to our system. Economists have long understood this issue, since it is analogous to the design of the rules governing auctions and other marketplaces, in which we attempt to achieve socially-desirable outcomes despite the impossibility of prescribing the exact behaviour of the market participants, who may attempt to subvert the market for their own personal gain. This field is known as “mechanism design”: the science of designing rules of a game to achieve a specific outcome, even though each participant may be self-interested. Although it originated in economics, mechanism design has become an important foundation of multi-agent systems (MAS) research. In a traditional mechanism design problem, analytical methods are used to prove that agents’ game-theoretically optimal strategies lead to socially desirable outcomes. In many scenarios, traditional mechanism design and auction theory yield clear-cut results; however, there are many situations in which the underlying assumptions of the theory are violated due to the messiness of the real-world. In this paper we review alternative approaches to mechanism design which treat it as an engineering problem and bring to bear engineering design principles, viz. : iterative step-wise refinement of solutions, and satisficing instead of optimization in the face of intractable complexity. We categorize these approaches under the banner of evolutionary mechanism design.

AAMAS Conference 2009 Conference Paper

Inconsistency Tolerance in Weighted Argument Systems

  • Paul E. Dunne
  • Anthony Hunter
  • Peter McBurney
  • Simon Parsons
  • Michael Wooldridge

We introduce and investigate a natural extension of Dung’s wellknown model of argument systems in which attacks are associated with a weight, indicating the relative strength of the attack. A key concept in our framework is the notion of an inconsistency budget, which characterises how much inconsistency we are prepared to tolerate: given an inconsistency budget β, we would be prepared to disregard attacks up to a total cost of β. The key advantage of this approach is that it permits a much finer grained level of analysis of argument systems than unweighted systems, and gives useful solutions when conventional (unweighted) argument systems have none. We begin by reviewing Dung’s abstract argument systems, and present the model of weighted argument systems. We then investigate solutions to weighted argument systems and the associated complexity of computing these solutions, focussing in particular on weighted variations of grounded extensions.

AAMAS Conference 2008 Conference Paper

Annotation and Matching of First-Class Agent Interaction Protocols

  • Tim Miller
  • Peter McBurney

Many practitioners view agent interaction protocols as rigid specifications that are defined a priori, and hard-code their agents with a set of protocols known at design time — an unnecessary restriction for intelligent and adaptive agents. To achieve the full potential of multi-agent systems, we believe that it is important that multi-agent interaction protocols are treated as first-class computational entities in systems. That is, they exist at runtime in systems as entities that can be referenced, inspected, composed, invoked and shared, rather than as abstractions that emerge from the behaviour of the participants. Using first-class protocols, a goal-directed agent can assess a library of protocols at runtime to determine which protocols best achieve a particular goal. In this paper, we present three methods for annotating protocols with their outcomes, and matching protocols using these annotations so that an agent can quickly and correctly find the protocols in its library that achieve a given goal. We discuss the advantages and disadvantages of each of these methods.

AAMAS Conference 2008 Conference Paper

Characterizing effective auction mechanisms: Insights from the 2007 TAC market design competition

  • Jinzhong Niu
  • Kai Cai
  • Enrico Gerding
  • Peter McBurney
  • Simon Parsons

This paper analyzes the entrants to the 2007 TAC Market Design competition. It presents a classification of the entries to the competition, and uses this classification to compare these entries. The paper also attempts to relate market dynamics to the auction rules adopted by these entries and their adaptive strategies via a set of post-tournament experiments. Based on this analysis, the paper speculates about the design of effective auction mechanisms, both in the setting of this competition and in the more general case.

JAAMAS Journal 2008 Journal Article

Editorial: Special issue on foundations, advanced topics and industrial perspectives of multi-agent systems

  • Peter McBurney
  • Andrea Omicini

Abstract This paper introduces the Special Issue of the Journal of Autonomous Agents and Multi-Agent Systems on Foundations, Advanced Topics and Industrial Perspectives of Multi-Agent Systems. This special issue collects four articles dealing with some of the main issues that arose during the three Technical Forum Group meetings held in 2004 and 2005, which were organised and sponsored by the European FP6 Coordination Action AgentLink III.

ECAI Conference 2008 Conference Paper

Optimal Coalition Structure Generation In Partition Function Games

  • Tomasz Pawel Michalak
  • Andrew James Dowell
  • Peter McBurney
  • Michael J. Wooldridge

The authors are grateful for financial support received from the UK EP-SRC through the project Market-Based Control of Complex Computational Systems (GR/T10657/01). The authors are also thankful to Jennifer McManus, School of English, University of Liverpool for excellent editorial assistance.

AAMAS Conference 2007 Conference Paper

Arguing for Gaining Access to Information

  • Sylvie Doutre
  • Peter McBurney
  • Laurent Perrussel
  • Jean-Marc Thevenin

This paper presents a protocol for agents engaged in argumentation over access to information sources. Obtaining relevant information is essential for agents engaged in autonomous, goal-directed behavior, but access to such information is usually controlled by other autonomous agents having their own goals. Because these various goals may be in conflict with one another, rational interactions between the two agents may take the form of a dialog, in which requests for information are successively issued, considered, justified and criticized. Even when the agents involved in such discussions agree on all the arguments for and the arguments against granting access to some information source, they may still disagree on their preferences between these arguments.

IS Journal 2007 Journal Article

Guest Editors' Introduction: Argumentation Technology

  • Iyad Rahwan
  • Peter McBurney

This introduction to the special issue on argumentation technology discusses argumentation's role in modern computing. It also identifies the challenges that the community must meet before it can achieve widespread deployment of argumentation technologies.

TAAS Journal 2007 Journal Article

Introduction to the special issue

  • Paolo Petta
  • Andrea Omicini
  • Terry Payne
  • Peter McBurney

This article introduces the special issue of ACM Transactions on Autonomous and Adaptive Systems devoted to research papers arising from the three Technical Forum Group meetings held in 2004 and 2005 that were organized and sponsored by the European FP6 Coordination Action AgentLink III.

AAMAS Conference 2007 Conference Paper

On the Relevance of Utterances in Formal Inter-Agent Dialogues

  • Simon Parsons
  • Peter McBurney
  • Elizabeth Sklar
  • Michael Wooldridge

Work on argumentation-based dialogue has defined frameworks within which dialogues can be carried out, established protocols that govern dialogues, and studied di erent properties of dialogues. This work has established the space in which agents are permitted to interact through dialogues. Recently, there has been increasing interest in the mechanisms agents might use to choose how to act–the rhetori- cal manoeuvring that they use to navigate through the space defined by the rules of the dialogue. Key in such considerations is the idea of relevance, since a usual requirement is that agents stay focussed on the subject of the dialogue and only make relevant remarks. Here we study several notions of relevance, showing how they can be related to both the rules for carrying out dialogues and to rhetorical manoeuvring.

IS Journal 2007 Journal Article

The Agents Are All Busy Doing Stuff!

  • Peter McBurney
  • Michael Luck

In answer to the question, "Where have all the agents gone? " this column asserts that agent technologies are pervasive, not missing.

KER Journal 2006 Journal Article

Crossing the agent technology chasm: Lessons, experiences and challenges in commercial applications of agents

  • STEVE MUNROE
  • Tim Miller
  • ROXANA A. BELECHEANU
  • Michal Pěchouček
  • Peter McBurney
  • Michael Luck

Agent software technologies are currently still in an early stage of market development, where, arguably, the majority of users adopting the technology are visionaries who have recognized the long-term potential of agent systems. Some current adopters also see short-term net commercial benefits from the technology, and more potential users will need to perceive such benefits if agent technologies are to become widely used. One way to assist potential adopters to assess the costs and benefits of agent technologies is through the sharing of actual deployment histories of these technologies. Working in collaboration with several companies and organizations in Europe and North America, we have studied deployed applications of agent technologies, and we present these case studies in detail in this paper. We also review the lessons learnt, and the key issues arising from the deployments, to guide decision-making in research, in development and in implementation of agent software technologies.

AILAW Journal 2006 Journal Article

PARMENIDES: Facilitating Deliberation in Democracies

  • Katie Atkinson
  • Trevor Bench-Capon
  • Peter McBurney

Abstract Governments and other groups interested in the views of citizens require the means to present justifications of proposed actions, and the means to solicit public opinion concerning these justifications. Although Internet technologies provide the means for such dialogues, system designers usually face a choice between allowing unstructured dialogues, through, for example, bulletin boards, or requiring citizens to acquire a knowledge of some argumentation schema or theory, as in, for example, ZENO. Both of these options present usability problems. In this paper, we describe an implemented system called PARMENIDES which allows structured argument over a proposed course of action, without requiring knowledge of the underlying argumentation theory.

KER Journal 2003 Journal Article

Argumentation-based negotiation

  • Iyad Rahwan
  • Sarvapali D. Ramchurn
  • Nicholas R. Jennings
  • Peter McBurney
  • Simon Parsons
  • Liz Sonenberg

Negotiation is essential in settings where autonomous agents have conflicting interests and a desire to cooperate. For this reason, mechanisms in which agents exchange potential agreements according to various rules of interaction have become very popular in recent years as evident, for example, in the auction and mechanism design community. However, a growing body of research is now emerging which points out limitations in such mechanisms and advocates the idea that agents can increase the likelihood and quality of an agreement by exchanging arguments which influence each others' states. This community further argues that argument exchange is sometimes essential when various assumptions about agent rationality cannot be satisfied. To this end, in this article, we identify the main research motivations and ambitions behind work in the field. We then provide a conceptual framework through which we outline the core elements and features required by agents engaged in argumentation-based negotiation, as well as the environment that hosts these agents. For each of these elements, we survey and evaluate existing proposed techniques in the literature and highlight the major challenges that need to be addressed if argument-based negotiation research is to reach its full potential.

NMR Workshop 2002 Conference Paper

Decision making by intelligent agents: logical argument, probabilistic inference and the maintenance of beliefs and acts

  • John Fox 0001
  • Peter McBurney

The PROfonna is a language and a technology for designing, implementing, testing and delivering software agents that can operate in dynamic and uncertain environments. ‘The agent specification language is based on R°L, a logic language that formalises reasoning, decision-making and plan execution using a combination of classical and non-classical logics. PROforma can be viewed as an objectoriented layer on top of RL that reifies the logic into a small set of “tasks”, notably decisions, plans and I/O tasks. The heart of decision-making in both PROforma and R’L is a logical decision model based on the creation and evaluation of arguments for and against alternative beliefs and actions. In previous papers we have provided prooftheoretic and model-theoretic semantics for a Logic of Argument and suggested that argumentation is a general framework which subsumes many different forms of uncertain reasoning as special cases, including qualitative and nonmonotonic logics; quantitative representations like probability and possibility, and “linguistic” representations of belief. Current implementations support a simple monotonic interpretation of argument based decisionmaking but do not address requirements for defeasibility or probabilistic belief revision. In this paper we discuss how argumentation can provide a framework for integrating these approaches into a unified agent. Peter McBurney Department of Computer Science University of Liverpool Liverpool L69 7ZF U.K.

UAI Conference 2002 Conference Paper

Formalizing Scenario Analysis

  • Peter McBurney
  • Simon Parsons

We propose a formal treatment of scenarios in the context of a dialectical argumentation formalism for qualitative reasoning about uncertain propositions. Our formalism extends prior work in which arguments for and against uncertain propositions were presented and compared in interaction spaces called Agoras. We now define the notion of a scenario in this framework and use it to define a set of qualitative uncertainty labels for propositions across a collection of scenarios. This work is intended to lead to a formal theory of scenarios and scenario analysis.

UAI Conference 2000 Conference Paper

Risk Agoras: Dialectical Argumentation for Scientific Reasoning

  • Peter McBurney
  • Simon Parsons

We propose a formal framework for intelligent systems which can reason about scientific domains, in particular about the carcinogenicity of chemicals, and we study its properties. Our framework is grounded in a philosophy of scientific enquiry and discourse, and uses a model of dialectical argumentation. The formalism enables representation of scientific uncertainty and conflict in a manner suitable for qualitative reasoning about the domain.