ACM Home Page ACM Digital Library Home Page
feedback Feedback | Switch to tabbed view

top of pageABSTRACT

In this paper we present an advanced bidding agent that participates in first-price sealed bid auctions to allocate advertising space on BluScreen - an experimental public advertisement system that detects users through the presence of their Bluetooth enabled devices. Our bidding agent is able to build probabilistic models of both the behaviour of users who view the adverts, and the auctions that it participates within. It then uses these models to maximise the exposure that its adverts receive. We evaluate the effectiveness of this bidding agent through simulation against a range of alternative selection mechanisms including a simple bidding strategy, random allocation, and a centralised optimal allocation with perfect foresight. Our bidding agent significantly outperforms both the simple bidding strategy and the random allocation, and in a mixed population of agents it is able to expose its adverts to 25% more users than the simple bidding strategy. Moreover, its performance is within 7.5% of that of the centralised optimal allocation despite the highly uncertain environment in which it must operate.

top of pageAUTHORS

Author image not provided  Alex Rogers

No contact information provided yet.

Bibliometrics: publication history
Publication years1997-2011
Publication count44
Citation Count118
Available for download26
Downloads (6 Weeks)141
Downloads (12 Months)1,252
View colleagues of Alex Rogers

Author image not provided  Esther David

No contact information provided yet.

Bibliometrics: publication history
Publication years1999-2007
Publication count11
Citation Count58
Available for download8
Downloads (6 Weeks)24
Downloads (12 Months)277
View colleagues of Esther David

Author image not provided  Terry R. Payne

No contact information provided yet.

Bibliometrics: publication history
Publication years1997-2011
Publication count77
Citation Count671
Available for download20
Downloads (6 Weeks)80
Downloads (12 Months)730
View colleagues of Terry R. Payne

Nicholas R. Jennings Nicholas R. Jennings

Home Page
Bibliometrics: publication history
Publication years1992-2011
Publication count266
Citation Count3,710
Available for download95
Downloads (6 Weeks)445
Downloads (12 Months)3,987
View colleagues of Nicholas R. Jennings

top of pageREFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

S. Gjerstad and J. Dickhaut. Price formation in double auctions. Games and Economic Behavior, (22):1--29, 1998.
T. R. Payne, E. David, M. Sharifi, and N. R. Jennings. Auction mechanisms for efficient advertisment selection on public display. In Proc. of the 17th European Conf. on Artificial Intelligence, pages 285--289, Trentino, Italy, 2006.
M. Rothkopf, T. Teisberg, and E. Kahn. Why are vickrey auctions rare? Journal of Political Economy, 98(1):94--109, 1990.

top of pageCITED BY

top of pageINDEX TERMS

top of pagePUBLICATION

Title AAMAS '07 Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems table of contents
Conference Chairs Edmund Durfee University of Michigan
Makoto Yokoo Kyushu University
Program Chairs Michael Huhns University of South Carolina
Onn Shehory IBM Haifa Research Lab, Israel
Article No. 51
PublisherACM New York, NY, USA ©2007
ISBN: 978-81-904262-7-5 doi>10.1145/1329125.1329186
Conference AAMASInternational Conference on Autonomous Agents and Multiagent Systems AAMAS logo
Paper Acceptance Rate 122 of 531 submissions, 23%
Overall Acceptance Rate 513 of 2,386 submissions, 22%
Year Submitted Accepted Rate
AAMAS '06 553 127 23%
AAMAS '07 531 122 23%
AAMAS '09 651 132 20%
AAMAS '09 651 132 20%
Overall 2,386 513 22%

top of pageREVIEWS

Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Table of Contents
SESSION: Invited talks
Using agents and autonomic computing to build next generation seamless mobility services
John Strassner
Article No.: 1
Full text: PDFPDF

Next generation networks seek to integrate wide-area and local-area wireless and wired systems in order to provide seamless services to the end user, providing freedom of movement between metropolitan/enterprise and indoor/outdoor coverage while maintaining ...
Multiagent systems for autonomic computing
Jeffrey A. Kephart
Article No.: 2
Full text: PDFPDF

Autonomic computing is a perfect application domain for autonomous agents and multiagent systems. Expanding on this theme, I will illustrate it with various prototypes my team has developed. Rather than building on existing agent platforms, we have started ...
Automated negotiation in open environments: (by ACM/SIGART autonomous agents research award winner)
Sarit Kraus
Article No.: 3
Full text: PDFPDF

Agents in open environments lack a central mechanism for controlling their behavior, and they may encounter human decision-makers whose behavior is affected by social and psychological factors. Examples include online markets, patient care-delivery systems; ...
Robots are agents, too!
Gal Kaminka
Article No.: 4
Full text: PDFPDF

Recent years are seeing dramatically growing interest in robots, side-by-side, paradoxically, with a worrisome decline in robotics work within the autonomous agent community. This, despite the significant opportunities enabled by viewing robots as agents. ...
SESSION: Embodied agents and architectures: full papers
What can i do with this?: finding possible interactions between characters and objects
Pedro Sequeira, Marco Vala, Ana Paiva
Article No.: 5
Full text: PDFPDF

Virtual environments are often populated by autonomous synthetic agents capable of acting and interacting with other agents as well as with humans. These virtual worlds also include objects that may have different uses and types of interactions. As such, ...
Aborting tasks in BDI agents
John Thangarajah, James Harland, David Morley, Neil Yorke-Smith
Article No.: 6
Full text: PDFPDF

Intelligent agents that are intended to work in dynamic environments must be able to gracefully handle unsuccessful tasks and plans. In addition, such agents should be able to make rational decisions about an appropriate course of action, which may include ...
Goals in the context of BDI plan failure and planning
Sebastian Sardina, Lin Padgham
Article No.: 7
Full text: PDFPDF

We develop a Belief-Desire-Intention (BDI) style agent-oriented programming language with special emphasis on the semantics of goals in the presence of the typical BDI failure handling present in many BDI systems and a novel account of hierarchical ...
Evaluating a conversation-centered interactive drama
Manish Mehta, Steven Dow, Michael Mateas, Blair MacIntyre
Article No.: 8
Full text: PDFPDF

There is a growing interest in developing technologies for creating interactive dramas [13, 22]. Evaluating them, however, remains an open research problem. In this paper, we present a method for evaluating the technical and design approaches employed ...
SESSION: Embodied agents and architectures: poster papers
Automatic annotation of team actions in observations of embodied agents
Linus J. Luotsinen, Hans Fernlund, Ladislau Bölöni
Article No.: 9
Full text: PDFPDF

Recognizing and annotating the occurrence of team actions in observations of embodied agents has applications in surveillance and in training of military or sport teams. We describe the team actions through a spatio-temporal correlated pattern of movement, ...
Agents that remember can tell stories: integrating autobiographic memory into emotional agents
Wan Ching Ho, João Dias, Rui Figueiredo, Ana Paiva
Article No.: 10
Full text: PDFPDF

For the past few years many new applications are being developed featuring interactive environments populated with autonomous virtual agents capable of acting according to their goals, beliefs and even social relations. Such agents must be able ...
EBDI: an architecture for emotional agents
Hong Jiang, Jose M. Vidal, Michael N. Huhns
Article No.: 11
Full text: PDFPDF

Most of the research on multiagent systems has focused on the development of rational utility-maximizing agents. However, research shows that emotions have a strong effect on peoples' physical states, motivations, beliefs, and desires. By introducing ...
Extending character-based storytelling with awareness and feelings
David Pizzi, Marc Cavazza, Jean-Luc Lugrin
Article No.: 12
Full text: PDFPDF

Most Interactive Storytelling systems developed to date have followed a task-based approach to story representation, using planning techniques to drive the story by generating a sequence of actions, which essentially "solve" the task to which the story ...
Approximate state estimation in multiagent settings with continuous or large discrete state spaces
Prashant Doshi
Article No.: 13
Full text: PDFPDF

We present a new method for carrying out state estimation in multi-agent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagent settings involves updating an agent's belief over the physical states ...
Dynamic movement and positioning of embodied agents in multiparty conversations
Dusan Jan, David R. Traum
Article No.: 14
Full text: PDFPDF

For embodied agents to engage in realistic multiparty conversation, they must stand in appropriate places with respect to other agents and the environment. When these factors change, such as an agent joining the conversation, the agents must dynamically ...
SESSION: Partially cooperative multiagent systems: full papers
Meta-level coordination for solving negotiation chains in semi-cooperative multi-agent systems
Xiaoqin Zhang, Victor Lesser
Article No.: 15
Full text: PDFPDF

A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the chain so as to optimize the expected utility, we present an extension to ...
Policy recognition for multi-player tactical scenarios
Gita Sukthankar, Katia Sycara
Article No.: 16
Full text: PDFPDF

This paper addresses the problem of recognizing policies given logs of battle scenarios from multi-player games. The ability to identify individual and team policies from observations is important for a wide range of applications including automated ...
Emergence of global network property based on multi-agent voting model
Kosuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
Article No.: 17
Full text: PDFPDF

Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to generate complex networks using a multi-agent approach. Each node is considered ...
Towards self-organising agent-based resource allocation in a multi-server environment
Tino Schlegel, Ryszard Kowalczyk
Article No.: 18
Full text: PDFPDF

Distributed applications require distributed techniques for efficient resource allocation. These techniques need to take into account the heterogeneity and potential unreliability of resources and resource consumers in a distributed environments. In ...
SESSION: Partially cooperative multiagent systems: poster papers
Dynamics of contracts-based organizations: a formal approach based on institutions
Yathiraj B. Udupi, Munindar P. Singh
Article No.: 19
Full text: PDFPDF

An organization comprises a group of collaborating agents (individual agents or nested organizations) that exhibit complex behaviors. Of particular interest are dynamic organizations that form and dissolve as their members' needs change. Such organizations ...
Arguing for gaining access to information
Sylvie Doutre, Peter McBurney, Laurent Perrussel, Jean-Marc Thevenin
Article No.: 20
Full text: PDFPDF

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 ...
A unified framework for multi-agent agreement
Kiran Lakkaraju, Les Gasser
Article No.: 21
Full text: PDFPDF

Multi-Agent Agreement Problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from distributed sensor networks, to meeting scheduling, to development of norms, ...
Autonomous nondeterministic tour guides: improving quality of experience with TTD-MDPs
Andrew S. Cantino, David L. Roberts, Charles L. Isbell
Article No.: 22
Full text: PDFPDF

In this paper, we address the problem of building a system of autonomous agents for a complex environment, in our case, a museum with many visitors. Visitors may have varying preferences for types of art or may wish to visit different exhibits on multiple ...
Strategic delay in bargaining
Pinata Winoto, Gordon I. McCalla, Julita Vassileva
Article No.: 23
Full text: PDFPDF

We study strategic delay in bargaining under uncertainty. First, we discuss bargaining situations in which dynamics and uncertainty may induce the use of strategic delay by intelligent agents. Then, we analyze strategic delay under various circumstances. ...
When price is not enough: combining logical and numerical issues in bilateral negotiation
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Article No.: 24
Full text: PDFPDF

We present a novel approach to knowledge-based automated one-shot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical ones. To this aim we introduce P(N), a propositional logic extended ...
SESSION: Communications and commitments: full papers
Dynamic semantics for agent communication languages
Michael Rovatsos
Article No.: 25
Full text: PDFPDF

This paper proposes dynamic semantics for agent communication languages (ACLs) as a method for tackling some of the fundamental problems associated with agent communication in open multiagent systems. Based on the idea of providing alternative semantic ...
Commitment and extortion
Paul Harrenstein, Felix Brandt, Felix Fischer
Article No.: 26
Full text: PDFPDF

Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents. Which commitments a player can make with credibility depends on ...
Enacting protocols by commitment concession
Pinar Yolum, Munindar P. Singh
Article No.: 27
Full text: PDFPDF

Commitment protocols formalize interactions among autonomous, heterogeneous agents, leaving the agents' local policies unspecified. This paper studies the problem of agents enacting commitment protocols, which inherently requires that their policies ...
Temporal linear logic as a basis for flexible agent interactions
Duc Q. Pham, James Harland
Article No.: 28
Full text: PDFPDF

Interactions between agents in an open system such as the Internet require a significant degree of flexibility. A crucial aspect of the development of such methods is the notion of commitments, which provides a mechanism for coordinating interactive ...
SESSION: Communications and commitments: poster papers
Choice and interoperation in protocol enactment
Amit K. Chopra, Munindar P. Singh
Article No.: 29
Full text: PDFPDF

Protocols describe interactions among agents and thus underlie the engineering of multiagent systems. However, protocols are enacted by agents in physical systems. In particular, considerations of communication models and how distributed agents are able ...
Joint conversation specification and compliance
Shamimabi Paurobally, Michael J. Wooldridge
Article No.: 30
Full text: PDFPDF

Formal specifications of protocol-oriented agent interactions have focused mainly on the semantics of the constituent agent communication language (ACL). We argue that a proper theoretical treatment of conversations cannot be simply derived compositionally ...
Designing protocols for agent institutions
Huib Aldewereld, Frank Dignum, John-Jules Ch. Meyer
Article No.: 31
Full text: PDFPDF

Agent-mediated institutions (or e-institutions), introduced in [9], are open agent systems that allow heterogeneous agents to enter and perform tasks. The e-institutions specify the admissible behaviour of the agents by means of norms, which are ...
Deriving agent-centred representations of protocols described using propositional statecharts
Hywel Dunn-Davies, Jim Cunningham
Article No.: 32
Full text: PDFPDF

Diagrammatic methodologies for the representation of agent interaction protocols can be classified as joint representations that describe an interaction in terms of a single sequential process, or agent-centred representations that provide a distinct ...
Toward verification of commitment protocols and their compositions
Nirmit Desai, Zhengang Cheng, Amit K. Chopra, Munindar P. Singh
Article No.: 33
Full text: PDFPDF

Commitment protocols have been proposed as a basis for modeling and enacting interactions among agents, such as those needed to carry out business processes. A central idea is that protocols would be developed and shared via libraries, and refined and ...
Interactive dynamic influence diagrams
Kyle Polich, Piotr Gmytrasiewicz
Article No.: 34
Full text: PDFPDF

Partially Observable Markov Decision Processes (POMDPs) emerged as the primary framework for decision-theoretic planning in single agent settings. Solutions to POMDPs are optimal plans which are conditional on future observations. Dynamic Influence Diagrams ...
A component-based approach to standardising agent communication
Frank Guerin, Wamberto Vasconcelos
Article No.: 35
Full text: PDFPDF

We address the problem of standardising the semantics of agent communication. The diversity of existing approaches suggests that no single agent communication language can satisfactorily cater for all scenarios. However, standardising the way in which ...
Computing effective communication policies in multiagent systems
Doran Chakraborty, Sandip Sen
Article No.: 36
Full text: PDFPDF

Communication is a key tool for facilitating multiagent coordination in cooperative and uncertain domains. We focus on a class of multiagent problems modeled as Decentralized Markov Decision Processes with Communication (DEC-MDP-COM) with local observability. ...
SESSION: Multiagent learning: full papers
Transfer via inter-task mappings in policy search reinforcement learning
Matthew E. Taylor, Shimon Whiteson, Peter Stone
Article No.: 37
Full text: PDFPDF

The ambitious goal of transfer learning is to accelerate learning on a target task after training on a different, but related, source task. While many past transfer methods have focused on transferring value-functions, this paper presents a method for ...
SMILE: Sound Multi-agent Incremental LEarning
Gauvain Bourgne, Amal El Fallah Segrouchni, Henry Soldano
Article No.: 38
Full text: PDFPDF

This article deals with the problem of collaborative learning in a multi-agent system. Here each agent can update incrementally its beliefs B (the concept representation) so that it is in a way kept consistent with the whole set of information ...
Multiagent reinforcement learning and self-organization in a network of agents
Sherief Abdallah, Victor Lesser
Article No.: 39
Full text: PDFPDF

To cope with large scale, agents are usually organized in a network such that an agent interacts only with its immediate neighbors in the network. Reinforcement learning techniques have been commonly used to optimize agents local policies in such a network ...
Theoretical advantages of lenient Q-learners: an evolutionary game theoretic perspective
Liviu Panait, Karl Tuyls
Article No.: 40
Full text: PDFPDF

This paper presents the dynamics of multiple reinforcement learning agents from an Evolutionary Game Theoretic (EGT) perspective. We provide a Replicator Dynamics model for traditional multiagent Q-learning, and we extend these differential equations ...
Multiagent learning in adaptive dynamic systems
Andriy Burkov, Brahim Chaib-draa
Article No.: 41
Full text: PDFPDF

Classically, an approach to the multiagent policy learning supposed that the agents, via interactions and/or by using preliminary knowledge about the reward functions of all players, would find an interdependent solution called "equilibrium". Recently, ...
Regret based dynamics: convergence in weakly acyclic games
Jason R. Marden, Gürdal Arslan, Jeff S. Shamma
Article No.: 42
Full text: PDFPDF

No-regret algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of no-regret algorithms is that they are easily implementable in large scale multi-agent systems because players make decisions using only retrospective ...
Sharing experiences to learn user characteristics in dynamic environments with sparse data
David Sarne, Barbara J. Grosz
Article No.: 43
Full text: PDFPDF

This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agent system, has no a priori information about the structure of the distribution ...
SESSION: Multiagent learning: poster papers
Reducing the complexity of multiagent reinforcement learning
Andriy Burkov, Brahim Chaib-draa
Article No.: 44
Full text: PDFPDF

It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment's states. It was shown, however, that the learning complexity for the goal-directed problems may be substantially ...
Parallel reinforcement learning with linear function approximation
Matthew Grounds, Daniel Kudenko
Article No.: 45
Full text: PDFPDF

In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by using parallel hardware. Our approach is based on agents using the ...
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
Alessandro Lazaric, Enrique Munoz de Cote, Nicola Gatti
Article No.: 46
Full text: PDFPDF

We consider the problem of playing in repeated extensive form games where agents do not have any prior. In this situation classic game theoretical tools are inapplicable and it is common the resort to learning techniques. In this paper, we present a ...
SESSION: Applications and computational environments: full papers
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
Haizheng Zhang, Victor Lesser
Article No.: 47
Full text: PDFPDF

The dominant existing routing strategies employed in peer-to-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend on the content similarity between incoming queries and their direct neighboring ...
Estimating information value in collaborative multi-agent planning systems
David Sarne, Barbara J. Grosz
Article No.: 48
Full text: PDFPDF

This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in which computer agents support people who are carrying out complex tasks in ...
Information searching and sharing in large-scale dynamic networks
George A. Vouros
Article No.: 49
Full text: PDFPDF

Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for information searching and sharing that combines routing indices with token-based ...
Modelling the provenance of data in autonomous systems
Simon Miles, Steve Munroe, Michael Luck, Luc Moreau
Article No.: 50
Full text: PDFPDF

Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be demonstrably rigorous for the result to be deemed reliable. A provenance ...
An advanced bidding agent for advertisement selection on public displays
Alex Rogers, Esther David, Terry R. Payne, Nicholas R. Jennings
Article No.: 51
Full text: PDFPDF

In this paper we present an advanced bidding agent that participates in first-price sealed bid auctions to allocate advertising space on BluScreen - an experimental public advertisement system that detects users through the presence of their Bluetooth ...
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Cuihong Li, Bin Yu, Katia Sycara
Article No.: 52
Full text: PDFPDF

Distributed message relaying is an important function of a peer-to-peer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either create huge burden on communications or cause long response time. Moreover, ...
Bidding optimally in concurrent second-price auctions of perfectly substitutable goods
Enrico H. Gerding, Rajdeep K. Dash, David C. K. Yuen, Nicholas R. Jennings
Article No.: 53
Full text: PDFPDF

We derive optimal bidding strategies for a global bidding agent that participates in multiple, simultaneous second-price auctions with perfect substitutes. We first consider a model where all other bidders are local and participate in a single auction. ...
Collaboration among a satellite swarm
Grégory Bonnet, Catherine Tessier
Article No.: 54
Full text: PDFPDF

The paper deals with on-board planning for a satellite swarm via communication and negotiation. We aim at defining individual behaviours that result in a global behaviour that meets the mission requirements. We will present the formalization of the problem, ...
Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents
Christina Theocharopoulou, Ioannis Partsakoulakis, George A. Vouros, Kostas Stergiou
Article No.: 55
Full text: PDFPDF

This work proposes a method for allocating temporally interdependent tasks to homogeneous or heterogeneous cooperative agents in dynamic large-scale networks. This method views searching, task allocation and scheduling as an integrated problem that has ...
Solving large TÆMS problems efficiently by selective exploration and decomposition
Jianhui Wu, Edmund H. Durfee
Article No.: 56
Full text: PDFPDF

TÆMS is a hierarchical modeling language capable of representing complex task networks with intra-task uncertainties and inter-task dependencies. The uncertainty and complexity of the application domains represented in TÆMS models often lead ...
SESSION: Applications and computational environments: poster paper
A methodology for 3D electronic institutions
A. Bogdanovych, M. Esteva, S. Simoff, C. Sierra, H. Berger
Article No.: 57
Full text: PDFPDF

In this paper we propose a methodology for the construction of 3D electronic institutions. 3D electronic institutions are normative environments where software and human agents can participate and collaborate in a joint 3D Virtual World. The proposed ...
SESSION: Cognitive models for agents: full papers
Cognitive and social simulation of criminal behaviour: the intermittent explosive disorder case
Tibor Bosse, Charlotte Gerritsen, Jan Treur
Article No.: 58
Full text: PDFPDF

Criminal behaviour often involves a combination of physical, mental, social and environmental (multi-)agent aspects, such as neurological deviations, hormones, arousal, (non)empathy, targets and social control. This paper contributes a dynamical agent-based ...
Interactions between market barriers and communication networks in marketing systems
Ian N. Durbach, Jan H. Hofmeyr
Article No.: 59
Full text: PDFPDF

We investigate a framework where agents search for satisfying products by using referrals from other agents. Our model of a mechanism for transmitting word-of-mouth and the resulting behavioural effects is based on integrating a module governing the ...
Realistic cognitive load modeling for enhancing shared mental models in human-agent collaboration
Xiaocong Fan, John Yen
Article No.: 60
Full text: PDFPDF

Human team members often develop shared expectations to predict each other's needs and coordinate their behaviors. In this paper the concept "Shared Belief Map" is proposed as a basis for developing realistic shared expectations among a team of Human-Agent-Pairs ...
SESSION: Cognitive models for agents: poster papers
A computational model of human interaction and planning for heterogeneous multi-agent systems
Alexandre Pauchet, Nathalie Chaignaud, Amal El Fallah Seghrouchni
Article No.: 61
Full text: PDFPDF

In the framework of heterogeneous multi-agent systems, this paper presents an implemented cognitive model of cooperative problem-solving, based on a psychological experiment. We are interested in simulating how human subjects elaborate plans in situations ...
Forming and scaffolding human coalitions with a multi-agent framework
Leen-Kiat Soh, Nobel Khandaker
Article No.: 62
Full text: PDFPDF

With the advancement of teleconferencing technologies, human users are collaborating online more than ever today. To improve the efficiency and effectiveness of online human coalitions, one needs to support and facilitate collaborations among human users ...
Multiagent based construction for human-like architecture
Yifeng Zeng, Dennis Plougman Buus, Jorge Cordero H
Article No.: 63
Full text: PDFPDF

Collaborative construction is a main application in the field of autonomous systems. An interesting subject in the area is the construction of realistic human-like architecture. However, the task of building a human-like architecture is non-trivial since ...
SESSION: Mechanism design: full papers
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
Georgios Chalkiadakis, Evangelos Markakis, Craig Boutilier
Article No.: 64
Full text: PDFPDF

Coalition formation is a problem of great interest in AI, allowing groups of autonomous, rational agents to form stable teams. Furthermore, the study of coalitional stability concepts and their relation to equilibria that guide the strategic interactions ...
Eliciting single-peaked preferences using comparison queries
Vincent Conitzer
Article No.: 65
Full text: PDFPDF

Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alternatives (or at least a winning alternative) is produced. However, when ...
On the robustness of preference aggregation in noisy environments
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A. Kaminka
Article No.: 66
Full text: PDFPDF

In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theoretical model of noisy preference aggregation and formally defining the (worst-case) ...
Constraint satisfaction algorithms for graphical games
Vishal Soni, Satinder Singh, Michael P. Wellman
Article No.: 67
Full text: PDFPDF

We formulate the problem of computing equilibria in multi-player games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. The first is PureProp: an algorithm for computing approximate Nash equilibria ...
Factoring games to isolate strategic interactions
George B. Davis, Michael Benisch, Kathleen M. Carley, Norman M. Sadeh
Article No.: 68
Full text: PDFPDF

Game theoretic reasoning about multi-agent systems has been made more tractable by algorithms that exploit various types of independence in agents' utilities. However, previous work has assumed that a game's precise independence structure is given in ...
Sequential decision making in parallel two-sided economic search
David Sarne, Teijo Arponen
Article No.: 69
Full text: PDFPDF

This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly matched with several other agents in parallel, and makes a decision whether ...
SESSION: Mechanism design: poster paper
Requirements driven agent collaboration
Liwei Zheng, Zhi Jin
Article No.: 70
Full text: PDFPDF

This paper proposes the requirements driven agent collaboration. This proposal assumes that there are plenty different service agents distributed in Internet. When a request for accomplishing a particular task occurs, these autonomous agents can recognize ...
SESSION: Cooperation, coordination, and teamwork: full papers
Determining confidence when integrating contributions from multiple agents
Raphen Becker, Daniel D. Corkill
Article No.: 71
Full text: PDFPDF

Integrating contributions received from other agents is an essential activity in multi-agent systems (MASs). Not only must related contributions be integrated together, but the confidence in each integrated contribution must be determined. In this paper ...
Exploiting factored representations for decentralized execution in multiagent teams
Maayan Roth, Reid Simmons, Manuela Veloso
Article No.: 72
Full text: PDFPDF

In many cooperative multiagent domains, there exist some states in which the agents can act independently and others in which they need to coordinate with their teammates. In this paper, we explore how factored representations of state can be used to ...
Towards collaborative task and team maintenance
Gal A. Kaminka, Ari Yakir, Dan Erusalimchik, Nirom Cohen-Nov
Article No.: 73
Full text: PDFPDF

There is significant interest in modeling teamwork in agents. In recent years, it has become widely accepted that it is possible to separate teamwork from taskwork, providing support for domain-independent teamwork at an architectural level, using teamwork ...
Distributed management of flexible times schedules
Stephen F. Smith, Anthony Gallagher, Terry Zimmerman
Article No.: 74
Full text: PDFPDF

We consider the problem of managing schedules in an uncertain, distributed environment. We assume a team of collaborative agents, each responsible for executing a portion of a globally pre-established schedule, but none possessing a global view of either ...
Commitment-driven distributed joint policy search
Stefan Witwicki, Edmund Durfee
Article No.: 75
Full text: PDFPDF

Decentralized MDPs provide powerful models of interactions in multiagent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we develop a hierarchical approach to solving a restricted set of decentralized ...
Distributed task allocation in social networks
Mathijs de Weerdt, Yingqian Zhang, Tomas Klos
Article No.: 76
Full text: PDFPDF

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-hard. Moreover, it ...
SESSION: Cooperation, coordination, and teamwork: poster papers
Agent coordination by trade-off between locally diffusion effects and socially structural influences
Yichuan Jiang, Jiuchuan Jiang, Toru Ishida
Article No.: 77
Full text: PDFPDF

There were always two separated methods to make agent coordination: individual-local balance perspective and individual-society balance perspective. The first method only considered the balance between individual agents and their local neighbors; the ...
Provisioning heterogeneous and unreliable providers for service workflows
Sebastian Stein, Nicholas R. Jennings, Terry R. Payne
Article No.: 78
Full text: PDFPDF

In this paper, we address the problem of provisioning unreliable and heterogeneous service providers for the constituent tasks of abstract workflows. Specifically, we deal with unreliable providers by provisioning multiple service providers redundantly ...
The effect of task and environment factors on M.A.S. coordination and reorganization
Mattijs Ghijsen, Wouter Jansweijer, Bob Wielinga
Article No.: 79
Full text: PDFPDF

Research on organization of Multiagent Systems (M.A.S.) has shown that by adapting its organization, a M.A.S. is better able to operate in dynamic environments. In this paper we describe an experiment with a M.A.S. that consists of agents where the capability ...
ARTS: agent-oriented robust transactional system
Mingzhong Wang, Amy Unruh, Kotagiri Ramamohanarao
Article No.: 80
Full text: PDFPDF

This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent system robustness and reliability. ARTS abstractly considers agents as executors ...
Towards a logical theory of coordination and joint ability
Hojjat Ghaderi, Hector Levesque, Yves Lespérance
Article No.: 81
Full text: PDFPDF

The coordination of teams of cooperating but autonomous agents is a core problem in multiagent systems research. A team of agents is jointly able to achieve a goal if despite any incomplete knowledge or even false beliefs that they may have about ...
Implementing the maximum of monotone algorithms
Liad Blumrosen
Article No.: 82
Full text: PDFPDF

Running several sub-optimal algorithms and choosing-the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper deals with one significant flaw of this technique in environments where ...
SESSION: Formal models of agency: full papers
An adversarial environment model for bounded rational agents in zero-sum interactions
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschein, Gal Kaminka
Article No.: 83
Full text: PDFPDF

Multiagent environments are often not cooperative nor collaborative; in many cases, agents have conflicting interests, leading to adversarial interactions. This paper presents a formal Adversarial Environment model for bounded rational agents ...
Incentive compatible ranking systems
Alon Altman, Moshe Tennenholtz
Article No.: 84
Full text: PDFPDF

Ranking systems are a fundamental ingredient of multiagent environments and Internet Technologies. These settings can be viewed as social choice settings with two distinguished properties: the set of agents and the set of alternatives coincide, and the ...
Reasoning about judgment and preference aggregation
Thomas Ågotnes, Wiebe van der Hoek, Michael Wooldridge
Article No.: 85
Full text: PDFPDF

Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choice mechanisms that govern their interactions. The recently emerging field ...
SESSION: Formal models of agency: poster papers
Programming and simulation of quantum search agents
Matthias Klusch, René Schubotz
Article No.: 86
Full text: PDFPDF

Key idea of this work is to appropriately extend one prominent generic agent architecture, namely InteRRap [8], to the case of a quantum pattern matching (QPM) based type-I quantum search agent (QSA) that is supposed to run on a hybrid quantum computer, ...
A quantified epistemic logic for reasoning about multiagent systems
F. Belardinelli, A. Lomuscio
Article No.: 87
Full text: PDFPDF

We investigate quantified interpreted systems, a semantics for multiagent systems in which agents can reason about individuals, their properties, and the relationships among them. We analyse a first-order epistemic language interpreted on this semantics ...
A framework for reasoning about rational agents
Wojciech Jamroga, Nils Bulling
Article No.: 88
Full text: PDFPDF

We propose an extension of alternating-time temporal logic, that can be used for reasoning about the behavior and abilities of agents under various rationality assumptions.
SESSION: Societal aspects: full papers
A formal road from institutional norms to organizational structures
Davide Grossi, Frank Dignum, John-Jules Ch. Meyer
Article No.: 89
Full text: PDFPDF

Up to now, the way institutions and organizations have been used in the development of open systems has not often gone further than a useful heuristics. In order to develop systems actually implementing institutions and organizations, formal methods ...
Distributed norm management in regulated multiagent systems
Dorian Gaertner, Andres Garcia-Camino, Pablo Noriega, J.-A. Rodriguez-Aguilar, Wamberto Vasconcelos
Article No.: 90
Full text: PDFPDF

Norms are widely recognised as a means of coordinating multiagent systems. The distributed management of norms is a challenging issue and we observe a lack of truly distributed computational realisations of normative models. In order to regulate ...
Resolving conflict and inconsistency in norm-regulated virtual organizations
Wamberto Vasconcelos, Martin J. Kollingbaum, Timothy J. Norman
Article No.: 91
Full text: PDFPDF

Norm-governed virtual organizations define, govern and facilitate coordinated resource sharing and problem solving in societies of agents. With an explicit account of norms, openness in virtual organizations can be achieved: new components, designed ...
SESSION: Societal aspects: poster paper
Friends no more: norm enforcement in multiagent systems
Adrian Perreau de Pinninck, Carles Sierra, Marco Schorlemmer
Article No.: 92
Full text: PDFPDF

We propose a new distributed mechanism to enforce norms by ostracizing agents that do not abide by them. Our simulations have shown that, although complete ostracism is not always possible, the mechanism substantially reduces the number of norm violations.
SESSION: Learning: full papers
Automatic feature extraction for autonomous general game playing agents
David M. Kaiser
Article No.: 93
Full text: PDFPDF

The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful GGP agents must be able to extract relevant features from the formal game ...
Batch reinforcement learning in a complex domain
Shivaram Kalyanakrishnan, Peter Stone
Article No.: 94
Full text: PDFPDF

Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent's experience based on sequential actions in the environment. However, their most common algorithmic variants are ...
Model-based function approximation in reinforcement learning
Nicholas K. Jong, Peter Stone
Article No.: 95
Full text: PDFPDF

Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains difficult, a few impressive success stories notwithstanding. Most interesting ...
A framework for agent-based distributed machine learning and data mining
Jan Tozicka, Michael Rovatsos, Michal Pechoucek
Article No.: 96
Full text: PDFPDF

This paper proposes a framework for agent-based distributed machine learning and data mining based on (i) the exchange of meta-level descriptions of individual learning processes among agents and (ii) online reasoning about learning success and learning ...
SESSION: Learning: poster papers
Aggregation in multiagent systems and the problem of truth-tracking
Gabriella Pigozzi, Stephan Hartmann
Article No.: 97
Full text: PDFPDF

One of the major problems that artificial intelligence needs to tackle is the combination of different and potentially conflicting sources of information. Examples are multi-sensor fusion, database integration and expert systems development. In this ...
Adapting in agent-based markets: a study from TAC SCM
David Pardoe, Peter Stone
Article No.: 98
Full text: PDFPDF

An agent attempting to model market conditions may benefit from considering how various combinations of competitor strategies would impact these conditions. We give an illustration using a prediction task faced by our agent for the Supply Chain Management ...
Reinforcement learning with utility-aware agents for market-based resource allocation
Eduardo Rodrigues Gomes, Ryszard Kowalczyk
Article No.: 99
Full text: PDFPDF

In this paper we propose and investigate the use of Reinforcement Learning in a market-based resource allocation mechanism called Iterative Price Adjustment. Under standard assumptions, this mechanism uses demand functions that do not allow the agents ...
Towards reinforcement learning representation transfer
Matthew E. Taylor, Peter Stone
Article No.: 100
Full text: PDFPDF

Transfer learning problems are typically framed as leveraging knowledge learned on a source task to improve learning on a related, but different, target task. Current transfer methods are able to successfully transfer knowledge between agents in different ...
SESSION: Auctions and electronic markets: full papers
A winner determination algorithm for auction-based decentralized scheduling
Chun Wang, Hamada H. Ghenniwa, Weiming Shen
Article No.: 101
Full text: PDFPDF

This paper presents a formulation and an algorithm for the winner determination problem in auction-based decentralized scheduling. Without imposing a time line discretization, the proposed approach allows bidders to bid for the processing of a set of ...
Bidding algorithms for a distributed combinatorial auction
Benito Mendoza, José M. Vidal
Article No.: 102
Full text: PDFPDF

Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combinatorial auctions are centralized. The PAUSE auction is one of a few efforts ...
Outperforming the competition in multi-unit sealed bid auctions
Ioannis A. Vetsikas, Nicholas R. Jennings
Article No.: 103
Full text: PDFPDF

In this paper, we examine the behavior of bidding agents that are in direct competition with the other participants in an auction setting. Thus the agents are not simply trying to maximize their own utility, rather they wish to maximize a weighted difference ...
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Andrea Giovannucci, J. A. Rodriguez-Aguilar, Jesus Cerquides, Ulle Endriss
Article No.: 104
Full text: PDFPDF

Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high potential to be employed for the automated assembly of supply chains of ...
SESSION: Auctions and electronic markets: poster papers
Average-case tractability of manipulation in voting via the fraction of manipulators
Ariel D. Procaccia, Jeffrey S. Rosenschein
Article No.: 105
Market-driven agents with uncertain and dynamic outside options
Fenghui Ren, Kwang Mong Sim, Minjie Zhang
Article No.: 106
Full text: PDFPDF

One of the most crucial criterion in automated negotiation is how to reach a consensus agreement for all negotiators under any negotiation environment. Currently, most negotiation strategies can work under the static environment only. This paper presents ...
Infinitesimal nash transfers for resource allocation in strong social alliances
Paul-Amaury Matt, Francesca Toni
Article No.: 107
Full text: PDFPDF

We introduce a distributed and tractable mechanism for the allocation of continuously divisible resources to agents, that locally maximises the (Nash) product of their individual welfare. The mechanism involves specific m-resources-at-a-time multilateral ...
An incentive mechanism for eliciting fair ratings of sellers in e-marketplaces
Jie Zhang, Robin Cohen
Article No.: 108
Full text: PDFPDF

In this paper, we propose a novel incentive mechanism for eliciting fair ratings of selling agents from buying agents. In our mechanism, buyers model other buyers and select the most trustworthy ones as their neighbors from whom they can ask advice about ...
A service oriented marketplace for next generation networks
Donna Griffin, Dirk Pesch
Article No.: 109
Full text: PDFPDF

During the past few decades, the field of telecommunications has been the subject to a continuous evolution. Kridel [1] associates this evolution to three interrelated phenomena: shifts in regulations, increased competition and technological progress. ...
Online auctions for bidders with interdependent values
Florin Constantin, Takayuki Ito, David C. Parkes
Article No.: 110
Full text: PDFPDF

Interdependent values (IDV) is a valuation model allowing bidders in an auction to express their value for the item(s) to sell as a function of the other bidders' information. We investigate the incentive compatibility (IC) of single-item auctions for ...
SESSION: Distributed constraint processing: full papers
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
James Atlas, Keith Decker
Article No.: 111
Full text: PDFPDF

Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multiagent systems. Several current algorithms that solve general DCOP instances, including ADOPT and DPOP, arrange agents into a traditional pseudotree ...
Optimal on-line scheduling in stochastic multiagent systems in continuous space-time
Wim Wiegerinck, Bart van den Broek, Bert Kappen
Article No.: 112
Full text: PDFPDF

We consider multiagent systems with stochastic non-linear dynamics in continuous space-time. We focus on systems of agents that aim to visit a number of given target locations at given points in time at minimal control cost. The online optimization of ...
Robust coordination to sustain throughput of an unstable agent network
Rajesh Gautam, Kazuo Miyashita
Article No.: 113
Full text: PDFPDF

We present a multiagent coordination technique to maintain throughput of a large-scale agent network system in the face of failures of agents. Failures do not just deteriorate throughput of the system but also create and change bottlenecks in the system. ...
Sequential resource allocation in multiagent systems with uncertainties
Jianhui Wu, Edmund H. Durfee
Article No.: 114
Full text: PDFPDF

Exchanging scarce resources during execution among a group of agents is one way to improve the overall performance in multiagent systems with limited shared resources, but implementing optimal sequential resource allocation is often a nontrivial problem ...
SESSION: Distributed constraint processing: poster papers
Periodic real-time resource allocation for teams of progressive processing agents
Gilles Steeve Dibangoye, Abdel-Illah Mouaddib, Brahim Chaib-Draa
Article No.: 115
Full text: PDFPDF

In this paper, we focus on the problem of finding a periodic allocation strategy for teams of resource-bounded agents. We propose a real-time dynamic algorithm RTDA*, that exploits two key properties to avoid the exponential increase in the state and ...
Reciprocal negotiation over shared resources in agent societies
Sabyasachi Saha, Sandip Sen
Article No.: 116
Full text: PDFPDF

We are interested in domains where an agent repeatedly negotiates with other agents over shared resources where the demand or utility to the agent for the shared resources vary over time. We propose a protocol that will maximize social welfare if agents ...
Unifying distributed constraint algorithms in a BDI negotiation framework
Bao Chau Le Dinh, Kiam Tian Seow
Article No.: 117
Full text: PDFPDF

This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one that entails several agents to search for an agreement, which is a consistent ...
Matrix-based representation for coordination fault detection: a formal approach
Meir Kalech, Michael Lindner, Gal A. Kaminka
Article No.: 118
Full text: PDFPDF

Teamwork requires that team members coordinate their actions. The representation of the coordination is a key requirement since it influences the complexity and flexibility of reasoning team-members. One aspect of this requirement is detecting coordination ...
Distributed constraint propagation for diagnosis of faults in physical processes
Ana L. C. Bazzan, Bruno C. da Silva
Article No.: 119
Full text: PDFPDF

Most of the current research on distributed diagnosis in and for multiagent systems focuses on diagnosis of coordination failures. Proposed approaches for this problem are not efficient for diagnosing failures in physical devices. This paper proposes ...
SESSION: Multiagent planning: full papers
Distributed path planning for mobile robots using a swarm of interacting reinforcement learners
Christopher M. Vigorito
Article No.: 120
Full text: PDFPDF

Path planning for mobile robots in stochastic, dynamic environments is a difficult problem and the subject of much research in the field of robotics. While many approaches to solving this problem put the computational burden of path planning on the robot, ...
Dynamics based control with an application to area-sweeping problems
Zinovi Rabinovich, Jeffrey S. Rosenschein, Gal A. Kaminka
Article No.: 121
Full text: PDFPDF

In this paper we introduce Dynamics Based Control (DBC), an approach to planning and control of an agent in stochastic environments. Unlike existing approaches, which seek to optimize expected rewards (e.g., in Partially Observable Markov Decision Problems ...
Graph-based multiagent replanning algorithm
Jian Feng Zhang, Xuan Thang Nguyen, Ryszard Kowalczyk
Article No.: 122
Full text: PDFPDF

The paper presents a new approach for multiagent replanning based on Distributed Constraint Satisfaction (DisCSP) and Graph planning techniques. In this approach, a new distributed refinement strategy is proposed to construct a graph plan for fixing ...
Towards a formal framework for multi-objective multiagent planning
Abdel-Illah Mouaddib, Mathieu Boussard, Maroua Bouzid
Article No.: 123
Full text: PDFPDF

Multi-Objective Multiagent Planning (MOMAP) addresses the problem of resolving conflicts between individual agent interests and the group interests. In this paper, we address this problem by presenting a formal framework to represent objective relationships, ...
SESSION: Multiagent planning: poster papers
Knowledge and observations in the situation calculus
Ryan F. Kelly, Adrian R. Pearce
Article No.: 124
Full text: PDFPDF

We present a powerful new account of multiagent knowledge in the situation calculus and an effective reasoning procedure for handling knowledge queries. Our approach generalizes existing work by reifying the observations made by each agent as the world ...
Conflict estimation of abstract plans for multiagent systems
Toshiharu Sugawara, Satoshi Kurihara, Toshio Hirotsu, Kensuke Fukuda, Toshihiro Takada
Article No.: 125
Full text: PDFPDF

In hierarchical planning, selecting a plan at an abstract level affects planning performance because an abstract plan restricts the scope of primitive plans. However, if all primitive plans under the selected abstract plan have difficult-to-resolve conflicts ...
Diagnosis of plan step errors and plan structure violations
Cees Witteveen, Nico Roos, Adriaan ter Mors, Xiaoyu Mao
Article No.: 126
Full text: PDFPDF

Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. While in previous work we have concentrated on the first type of failures, in this paper we introduce the idea of diagnosing violations ...
Integrating motivations with planning
Alexandra Coddington
Article No.: 127
Full text: PDFPDF

This paper presents two models of goal generation which enable a motivated autonomous agent to generate goals in response to changes in its underlying drives or motivations, while it is both planning and executing. A Mars rover domain is used ...
SESSION: Environments and implementation techniques: full papers
Implementing commitment-based interactions
Michael Winikoff
Article No.: 128
Full text: PDFPDF

Although agent interaction plays a vital role in MAS, and message-centric approaches to agent interaction have their drawbacks, present agent-oriented programming languages do not provide support for implementing agent interaction that is flexible and ...
Normative system games
Thomas Ågotnes, Wiebe van der Hoek, Michael Wooldridge
Article No.: 129
Full text: PDFPDF

We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic properties of this model. In the underlying model of normative systems, ...
Operational semantics of multiagent interactions
Juan M. Serrano, Sergio Saugar
Article No.: 130
Full text: PDFPDF

The social stance advocated by institutional frameworks and most multiagent system methodologies has resulted in a wide spectrum of organizational and communicative abstractions which have found currency in several programming frameworks and software ...
Modular interpreted systems
Wojciech Jamroga, Thomas Ågotnes
Article No.: 131
Full text: PDFPDF

We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representations borrow the main ideas from interpreted systems of Halpern, ...
SESSION: Environments and implementation techniques: poster papers
A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, Hideyuki Mizuta
Article No.: 132
Full text: PDFPDF

There are many studies on ABS and several frameworks for ABS have already been published. However, there are few frameworks that can enable agent-based simulation using large numbers of agents. We have been developing a Java-based platform for Massive ...
The IRM4S model: the influence/reaction principle for multiagent based simulation
Fabien Michel
Article No.: 133
Full text: PDFPDF

The IRM4S model (Influence Reaction Model for Simulation) is an adaptation of the formalism of [2] for multiagent based simulations (MABS). The goal of IRM4S is to provide a framework that eases the use of the Influence/Reaction principle within MABS.
A WSA-based architecture for building multiagent systems
Aluizio Haendchen Filho, Hércules Antônio do Prado, Carlos José Pereira de Lucena
Article No.: 134
Full text: PDFPDF

This paper discusses some advantages of applying the SOA paradigm for the MAS development, showing a framework whose architecture follows the WSA reference model. We believe that service-oriented paradigm can simplify the MAS development because it demands ...
Mass programmed agents for simulating human strategies in large scale systems
Michal Chalamish, David Sarne, Sarit Kraus
Article No.: 135
Full text: PDFPDF

Simulation is an important tool for studying systems' behavior under specific conditions. In recent years, agent technology has been recognized as a promising new approach for developing simulation systems, in particular, Multiagent Systems (MAS) based ...
Breaking into industry: tool support for multiagent systems
Simon Lynch, Keerthi Rajendran
Article No.: 136
Full text: PDFPDF

Multiagent systems (MAS) research is well established yet there is little development of agent technology in industry. It has been suggested that this is due, in part, to the unavailability of support tools for Agent Oriented Software Engineering (AOSE). ...
Deterministic nonlinear modeling of ant algorithm with logistic multiagent system
Rodolphe Charrier, Christine Bourjot, Francois Charpillet
Article No.: 137
Full text: PDFPDF

Ant algorithms are one of the main programming paradigms in swarm intelligence. They are built on stochastic decision functions, which can also be found in other types of bio-inspired algorithms with the same mathematical form. However, though this modeling ...
Practical extensions in agent programming languages
Mehdi Dastani, Dirk Hobo, John-Jules Ch. Meyer
Article No.: 138
Full text: PDFPDF

This paper proposes programming constructs to improve the practical application of existing BDI-based agent-oriented programming languages that have formal semantics. The proposed programming constructs include operations such as testing, adopting and ...
Predictive fault tolerance in multiagent systems: a plan-based replication approach
Alessandro de Luna Almeida, Samir Aknine, Jean-Pierre Briot, Jacques Malenfant
Article No.: 139
Full text: PDFPDF

The fact that multiagent applications are prone to the same faults that any distributed system is susceptible to and the need for a higher quality of service in these systems justify the increasing interest in fault-tolerant multiagent systems. In this ...
Filters for semantic service composition in service-oriented multiagent systems
Alberto Fernández, Sascha Ossowski
Article No.: 140
Full text: PDFPDF

In Service-Oriented MAS middle-agents provide different kinds of matchmaking functionalities. If no adequate services are available for a specific request, a planning functionality can be used to build up composite services. In order to take advantage ...
Towards reflective mobile agents for resource-constrained mobile devices
Conor Muldoon, Gregory M. P. O'Hare, John F. Bradley
Article No.: 141
Full text: PDFPDF

The vision of ubiquitous computing is one in which resource constrained mobile devices form ad-hoc networks to enable the delivery of services that are sensitive and responsive to people. Such networks are dynamic and must be capable of dealing with ...
Prediction horizons in polyagent models
H. Van Dyke Parunak, Theodore C. Belding, Sven Brueckner
Article No.: 142
Full text: PDFPDF

Many agent-based models predict the future. Nonlinear interactions in most non-trivial domains make predictions useless beyond a certain point (the "prediction horizon"), as agent trajectories diverge. We exhibit this behavior in a simple agent-based ...
Towards simulating billions of agents in thousands of seconds
I. V. Aprameya Rao, Manish Jain, Kamalakar Karlapalem
Article No.: 143
Full text: PDFPDF

Building multiagent systems that can scale up to very large number of agents is a challenging research problem. In this paper, we present Distributed Multi Agent System Framework (DMASF), a system which can simulate billions of agents in thousands of ...
Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism
Prithviraj Dasgupta
Article No.: 144
Full text: PDFPDF

Over the past few years, peer-to-peer(p2p) unstructured networks have emerged as an attractive paradigm for enabling online interactions between a large number of users in a decentralized manner. However, the decentralized nature of unstructured p2p ...
SESSION: Formal models of agency: full papers
A temporal epistemic logic with a reset operation
Alessio Lomuscio, Bożena Woźna
Article No.: 145
Full text: PDFPDF

We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic "reset" operator defined on the intersection between epistemic and temporal relations. Additionally we show the logic has the finite model property, hence it ...
Agents, beliefs, and plausible behavior in a temporal setting
Nils Bulling, Wojciech Jamroga
Article No.: 146
Full text: PDFPDF

Logics of knowledge and belief are often too static and inflexible to be used on real-world problems. In particular, they usually offer no concept for expressing that some course of events is more likely to happen than another. We address this ...
A grounded specification language for agent programs
Mehdi Dastani, M. Birna van Riemsdijk, John-Jules Ch. Meyer
Article No.: 147
Full text: PDFPDF

This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable properties expressed in an agent specification language, i.e., that any agent ...
SESSION: Formal models of agency: poster papers
Contextual deliberation of cognitive agents in defeasible logic
M. Dastani, G. Governatori, A. Rotolo, I. Song, L. van der Torre
Article No.: 148
Full text: PDFPDF

Cognitive agents often deliberate about preferences among rules. Consider, for example, an agent with the obligation to travel to Paris next week leading to a desire to travel by train, with the preferences that if the desire to travel by train cannot ...
A design framework for generating BDI-agents from goal models
Loris Penserini, Anna Perini, Angelo Susi, Mirko Morandini, John Mylopoulos
Article No.: 149
Full text: PDFPDF

We define a tool-supported design framework that allows to specify an agent goal model and to automatically generate fragments of a BDI agent from it. We devise the design process as a transformation process from platform-independent design models to ...
Give agents their artifacts: the A&A approach for engineering working environments in MAS
Alessandro Ricci, Mirko Viroli, Andrea Omicini
Article No.: 150
Full text: PDFPDF

In human society, almost any cooperative working context accounts for different kinds of object, tool, artifacts in general, that humans adopt, share and intelligently exploit so as to support their working activities, in particular social ones. According ...
From desires to intentions through dialectical analysis
Nicolas D. Rotstein, Alejandro J. Garcia, Guillermo R. Simari
Article No.: 151
Full text: PDFPDF

In this work, we introduce a framework where defeasible argumentation is used for reasoning about beliefs, desires and intentions. A dialectical filtering process is introduced in order to obtain a subset of the agent's desires containing only those ...
Convergence and rate of convergence of a simple ant model
Amine Boumaza, Bruno Scherrer
Article No.: 152
Full text: PDFPDF

We present a simple ant model that solves a discrete foraging problem. We provide simulations and a convergence analysis. We argue that the ant population computes the solutions of some optimal control problems and converges in some well defined sense. ...
Delegation and mental states
Emiliano Lorini, Nicolas Troquard, Andreas Herzig, Cristiano Castelfranchi
Article No.: 153
Full text: PDFPDF

In the recent literature on multiagent systems there have been several proposals of formal systems for reasoning about delegation. Most of these approaches have dealt with the concept of delegation leaving mental states such as beliefs, goals and intentions ...
Model-based belief merging without distance measures
Verónica Borja Macías, Pilar Pozos Parra
Article No.: 154
Full text: PDFPDF

Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators have been proposed which use distance measures and aggregation functions. ...
SESSION: Argumentation and negotiation: full papers
A multilateral multi-issue negotiation protocol
Miniar Hemaissia, Amal El Fallah Seghrouchni, Christophe Labreuche, Juliette Mattioli
Article No.: 155
Full text: PDFPDF

In this paper, we present a new protocol to address multilateral multi-issue negotiation in a cooperative context. We consider complex dependencies between multiple issues by modelling the preferences of the agents with a multi-criteria decision aid ...
Approximate and online multi-issue negotiation
Shaheen S. Fatima, Michael Wooldridge, Nicholas R. Jennings
Article No.: 156
Full text: PDFPDF

This paper analyzes bilateral multi-issue negotiation between self-interested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors. There are m > 1 issues for negotiation where each issue is ...
A randomized method for the shapley value for the voting game
Shaheen S. Fatima, Michael Wooldridge, Nicholas R. Jennings
Article No.: 157
Full text: PDFPDF

The Shapley value is one of the key solution concepts for coalition games. Its main advantage is that it provides a unique and fair solution, but its main problem is that, for many coalition games, the Shapley value cannot be determined in polynomial ...
A unified and general framework for argumentation-based negotiation
Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis
Article No.: 158
Full text: PDFPDF

This paper proposes a unified and general framework for argumentation-based negotiation, in which the role of argumentation is formally analyzed. The framework makes it possible to study the outcomes of an argumentation-based negotiation. ...
Learning and joint deliberation through argumentation in multiagent systems
Santi Ontañón, Enric Plaza
Article No.: 159
Full text: PDFPDF

In this paper we will present an argumentation framework for learning agents (AMAL) designed for two purposes: (1) for joint deliberation, and (2) for learning from communication. The AMAL framework is completely based on learning from examples: the ...
Arguing and explaining classifications
Leila Amgoud, Mathieu Serrurier
Article No.: 160
Full text: PDFPDF

Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this paper, we apply this approach to the classification problem, whose purpose ...
SESSION: Cooperation, coordination, and teamwork: full papers
Searching for joint gains in automated negotiations based on multi-criteria decision making theory
Quoc Bao Vo, Lin Padgham
Article No.: 161
Full text: PDFPDF

It is well established by conflict theorists and others that successful negotiation should incorporate "creating value" as well as "claiming value." Joint improvements that bring benefits to all parties can be realised by (i) identifying attributes that ...
Matrix-based representation for coordination fault detection: a formal approach
Meir Kalech, Michael Lindner, Gal A. Kaminka
Article No.: 162
Full text: PDFPDF

Teamwork requires that team members coordinate their actions. The representation of the coordination is a key requirement since it influences the complexity and flexibility of reasoning team---members. One aspect of this requirement is detecting coordination ...
Unifying distributed constraint algorithms in a BDI negotiation framework
Bao Chau Le Dinh, Kiam Tian Seow
Article No.: 163
Full text: PDFPDF

This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one that entails several agents to search for an agreement, which is a consistent ...
SESSION: Trust and reputation: full papers
Dynamically learning sources of trust information: experience vs. reputation
Karen K. Fullam, K. Suzanne Barber
Article No.: 164
Full text: PDFPDF

Trust is essential when an agent must rely on others to provide resources for accomplishing its goals. When deciding whether to trust, an agent may rely on, among other types of trust information, its past experience with the trustee or on reputations ...
Rumours and reputation: evaluating multi-dimensional trust within a decentralised reputation system
Steven Reece, Alex Rogers, Stephen Roberts, Nicholas R. Jennings
Article No.: 165
Full text: PDFPDF

In this paper we develop a novel probabilistic model of computational trust that explicitly deals with correlated multi-dimensional contracts. Our starting point is to consider an agent attempting to estimate the utility of a contract, and we show that ...
Presumptive selection of trust evidence
Pierpaolo Dondio, Stephen Barrett
Article No.: 166
Full text: PDFPDF

1. This paper proposes a generic method for identifying elements in a domain that can be used as trust evidences. As an alternative to external infrastructured approaches based on certificates or user recommendations we propose a computation based on ...
SESSION: Trust and reputation: poster papers
Agent-based model of impact of socioeconomic stressors: a dynamic network perspective
Shah Jamal Alam, Ruth Meyer, Emma Norling
Article No.: 167
Full text: PDFPDF

We have developed an agent-based simulation model based on a real case study in the Sekhukhune district of the Limpopo province in South Africa. The work reported here is part of an ongoing project that deals with social complexity emerging from bottom-up ...
Reducing the complexity of logics for multiagent systems
Marcin Dziubiński, Rineke Verbrugge, Barbara Dunin-Kȩplicz
Article No.: 168
Full text: PDFPDF

Theories of multiagent systems (MAS), in particular those based on modal logics, often suffer from a high computational complexity. This is due in part to the combination of agents' individual attitudes (beliefs, goals and intentions), and even more ...
Strategy recommender agents (ALEX) - the methodology
Ronald Uriel Ruiz Ordóñez, Josep Lluis de la Rosa i Esteva, Javier Guzmán-Obando
Article No.: 169
Full text: PDFPDF

Agents for Alignment into strategy Experience (ALEX agents), a type of recommender agent (RA), are proposed here as a means of helping employees to perform tasks in line with the strategy adopted by their particular organization. ...
InterPol: a policy framework for managing trust and privacy in referral networks
Yathiraj B. Udupi, Munindar P. Singh
Article No.: 170
Full text: PDFPDF

Referral networks are a kind of P2P system consisting of autonomous agents who seek, provide services, or refer other service providers. Key applications include service discovery and selection, and knowledge sharing. This use of referrals is inspired ...
SSDPOP: improving the privacy of DCOP with secret sharing
Rachel Greenstadt, Barbara Grosz, Michael D. Smith
Article No.: 171
Full text: PDFPDF

multiagent systems designed to work collaboratively with groups of people typically require private information that people will entrust to them only if they have assurance that this information will be protected. Although Distributed Constraint Optimization ...
Towards provably secure trust and reputation systems in e-marketplaces
Reid Kerr, Robin Cohen
Article No.: 172
Full text: PDFPDF

In this paper, we present a framework for evaluating the security of trust and reputation systems for electronic marketplaces populated with buying and selling agents. Our proposed framework offers a method for researchers to understand the security ...
Mechanisms for norm emergence in multiagent societies
Bastin Tony Roy Savarimuthu, Maryam Purvis
Article No.: 173
Full text: PDFPDF

Norms are shared expectations of behaviours that exist in human societies. Norms help societies by increasing the predictability of individual behaviours and by improving co-operation and collaboration among members. Norms have been of interest to Multiagent ...
Social comparison in crowds: a short report
Gal A. Kaminka, Natalie Fridman
Article No.: 174
Full text: PDFPDF

Modeling crowd behavior is an important challenge for cognitive modelers. We propose a novel model of crowd behavior, based on Festinger's Social Comparison Theory, a social psychology theory known and expanded since the early 1950's. We propose a concrete ...
Socially embedded multi agent based simulation of financial market
Kiyoshi Izumi, Hiroki Matsui, Yutaka Matsuo
Article No.: 175
Full text: PDFPDF

This paper proposed a new approach that integrated an artificial market simulation and text-mining with real information. In this approach, economic trends were extracted from text data circulating in the real world. Then, the trends were inputted into ...
Robust methods for tracking intelligent agents playing in an artificial financial market
Nachi Gupta, Raphael Hauser, Neil F. Johnson
Article No.: 176
Full text: PDFPDF

When analyzing financial time-series for predictability, the norm has been to find trends and patterns directly in the series despite the inherent dynamical system apparent at the individual agent level. This underlying buy and sell model provides more ...
Preservation of obligations in a temporal and deontic framework
Jan Broersen, Julien Brunel
Article No.: 177
Full text: PDFPDF

We study logical properties that concern the preservation of future-directed obligations that have not been fulfilled yet. Our starting point is a product of temporal and deontic logics. We investigate some modifications of the semantics of the product ...
Integrating authority, deontics, and communications within a joint intention framework
Marcus J. Huber, Sanjeev Kumar, David McGee, Sean A. Lisse
Article No.: 178
Full text: PDFPDF

Many agents are fielded within environments requiring modeling traditional organizational structures such as military hierarchies and corporations, with their associated authority relationships and a strong form of responsibility associated with the ...
Making social choices from individuals' CP-nets
Keith Purrington, Edmund H. Durfee
Article No.: 179
Full text: PDFPDF

CP-nets are an attractive model for representing individual preferences, in part because they allow us to find the best outcome for an agent in time that is proportional to just the number of features in an outcome. In this paper, we investigate whether ...
Reputation in the joint venture game
Philip Hendrix, Barbara J. Grosz
Article No.: 180
Full text: PDFPDF

In many settings, agents need to identify competent partners to assist them in accomplishing tasks. Direct experience may not provide sufficient data to learn the competence of other agents. Reputation---a community-based assessment of agent competence---can ...
SESSION: Applications and computational environments: full papers
An efficient heuristic approach for security against multiple adversaries
Praveen Paruchuri, Jonathan P. Pearce, Milind Tambe, Fernando Ordonez, Sarit Kraus
Article No.: 181
Full text: PDFPDF

In adversarial multiagent domains, security, commonly defined as the ability to deal with intentional threats from other agents, is a critical issue. This paper focuses on domains where these threats come from unknown adversaries. These domains can be ...
An agent-based approach for privacy-preserving recommender systems
Richard Cissée, Sahin Albayrak
Article No.: 182
Full text: PDFPDF

Recommender Systems are used in various domains to generate personalized information based on personal user data. The ability to preserve the privacy of all participants is an essential requirement of the underlying Information Filtering architectures, ...
On the benefits of cheating by self-interested agents in vehicular networks
Raz Lin, Sarit Kraus, Yuval Shavitt
Article No.: 183
Full text: PDFPDF

As more and more cars are equipped with GPS and Wi Fi transmitters, it becomes easier to design systems that will allow cars to interact autonomously with each other, e.g., regarding traffic on the roads. Indeed, car manufacturers are already equipping ...
SESSION: Applications and computational environments: poster papers
Physics inspired multiagent system for vehicle platooning
Contet Jean-Michel, Gechter Franck, Gruer Pablo, Koukam Abder
Article No.: 184
Full text: PDFPDF

Since about two decades, many works have been made in order to provide solutions to the vehicle platoon problem. The main issue related to platoon systems consists in controling the global platoon geometry: inter vehicular distance and trajectory matching. ...
Towards valuation-aware agent-based traffic control
Heiko Schepperle, Klemens Böhm, Simone Forster
Article No.: 185
Full text: PDFPDF

Traffic authorities work hard to improve resource utilization in traffic. But these efforts do not consider that the valuations of waiting time can be different for each driver, e.g., a driver of a courier service delivering express mail typically has ...
SESSION: Perceptual and embedded agents: full papers
IFSA: incremental feature-set augmentation for reinforcement learning tasks
Mazda Ahmadi, Matthew E. Taylor, Peter Stone
Article No.: 186
Full text: PDFPDF

Reinforcement learning is a popular and successful framework for many agent-related problems because only limited environmental feedback is necessary for learning. While many algorithms exist to learn effective policies in such problems, learning is ...
On discovery and learning of models with predictive representations of state for agents with continuous actions and observations
David Wingate, Satinder Singh
Article No.: 187
Full text: PDFPDF

Models of agent-environment interaction that use predictive state representations (PSRs) have mainly focused on the case of discrete observations and actions. The theory of discrete PSRs uses an elegant construct called the system dynamics matrix and ...
Speeding up moving-target search
Sven Koenig, Maxim Likhachev, Xiaoxun Sun
Article No.: 188
Full text: PDFPDF

In this paper, we study moving-target search, where an agent (= hunter) has to catch a moving target (= prey). The agent does not necessarily know the terrain initially but can observe it within a certain sensor range around itself. It uses the strategy ...
Towards using multiple cues for robust object recognition
Sarah Aboutalib, Manuela Veloso
Article No.: 189
Full text: PDFPDF

A robot's ability to assist humans in a variety of tasks, e.g. in search and rescue or in a household, heavily depends on the robot's reliable recognition of the objects in the environment. Numerous approaches attempt to recognize objects based only ...
SESSION: Mechanism design and game theory: full papers
A computational characterization of multiagent games with fallacious rewards
Ariel D. Procaccia, Jeffrey S. Rosenschein
Article No.: 190
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament
Peter Bro Miltersen, Troels Bjerre Sørensen
Article No.: 191
Full text: PDFPDF

We analyze a heads-up no-limit Texas Hold'em poker tournament with a fixed small blind of 300 chips, a fixed big blind of 600 chips and a total amount of 8000 chips on the table (until recently, these parameters defined the heads-up endgame of sit-n-go ...
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker
Andrew Gilpin, Tuomas Sandholm
Article No.: 192
Full text: PDFPDF

We present new approximation methods for computing game-theoretic strategies for sequential games of imperfect information. At a high level, we contribute two new ideas. First, we introduce a new state-space abstraction algorithm. In each round of the ...
Empirical game-theoretic analysis of the TAC Supply Chain game
Patrick R. Jordan, Christopher Kiekintveld, Michael P. Wellman
Article No.: 193
Full text: PDFPDF

The TAC Supply Chain Management (TAC/SCM) game presents a challenging dynamic environment for autonomous decision-making in a salient application domain. Strategic interactions complicate the analysis of games such as TAC/SCM. since the effectiveness ...
SESSION: Mechanism design and game theory: poster papers
An adaptive strategy for minority games
Ka-man Lam, Ho-fung Leung
Article No.: 194
Full text: PDFPDF

Many real life situations, like the financial market, auctions and resources competitions, can be modeled as Minority Games. In minority games, players choose to join one of the two sides, A or B. The players are rewarded if they have joined ...
Routing games with an unknown set of active players
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
Article No.: 195
Full text: PDFPDF

In many settings there exists a set of potential participants, but the set of participants who are actually active in the system, and in particular their number, is unknown. This topic has been first analyzed by Ashlagi, Monderer, and Tennenholtz [AMT] ...
Requirements driven agent collaboration
Liwei Zheng, Zhi Jin
Article No.: 196
Full text: PDFPDF

This paper proposes the requirements driven agent collaboration. This proposal assumes that there are plenty different service agents distributed in Internet. When a request for accomplishing a particular task occurs, these autonomous agents can recognize ...
Coalition structure generation with worst case guarantees based on cardinality structure
She-Xiong Su, Shan-Li Hu, Chun-Yi Shi
Article No.: 197
Full text: PDFPDF

Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal ...
Some results on approximating the minimax solution in approval voting
Rob LeGrand, Evangelos Markakis, Aranyak Mehta
Article No.: 198
Full text: PDFPDF

Voting has been a very popular method for preference aggregation in multiagent environments. It is often the case that a set of agents with different preferences need to make a choice among a set of alternatives, where the alternatives could be various ...
SESSION: Cooperative distributed problem solving: full papers
A globally optimal algorithm for TTD-MDPs
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Charles L. Isbell, Michael Mateas
Article No.: 199
Full text: PDFPDF

In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)---a variant of MDPs in which the goal is to realize a specified distribution of trajectories through a state space---as a general agent-coordination ...
A Q-decomposition and bounded RTDP approach to resource allocation
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak Benaskeur
Article No.: 200
Full text: PDFPDF

This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Q-decomposition approach is proposed when the resources which are already shared among ...
Combinatorial resource scheduling for multiagent MDPs
Dmitri A. Dolgov, Michael R. James, Michael E. Samples
Article No.: 201
Full text: PDFPDF

Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial problem of scheduling the usage of multiple resources among agents that ...
Organizational self-design in semi-dynamic environments
Sachin Kamboj, Keith S. Decker
Article No.: 202
Full text: PDFPDF

Organizations are an important basis for coordination in multiagent systems. However, there is no best way to organize and all ways of organizing are not equally effective. Attempting to optimize an organizational structure depends strongly on environmental ...
SESSION: Cooperative distributed problem solving: poster papers
DisLRPɑ: ɑ-approximation in generalized mutual assignment
Katsutoshi Hirayama
Article No.: 203
Full text: PDFPDF

This paper presents a new distributed solution protocol, called DisLRPα, for the Generalized Mutual Assignment Problem (GMAP). The GMAP is a typical distributed combinatorial optimization problem whose goal is to maximize social ...
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
Paulo R. Ferreira, Jr., Felipe S. Boffo, Ana L. C. Bazzan
Article No.: 204
Full text: PDFPDF

This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a novel algorithm for distributed task allocation based on theoretical models ...
A statistical decision-making model for choosing among multiple alternatives
Shulamit Reches, Shavit Talman, Sarit Kraus
Article No.: 205
Full text: PDFPDF

Automated agents often have several alternatives to choose from in order to solve a problem. Usually the agent does not know in advance which alternative is the best one, so some exploration is required. However, in most cases there is a cost associated ...
Dynamic task allocation within an open service-oriented MAS architecture
Ivan J. Jureta, Stephane Faulkner, Youssef Achbany, Marco Saerens
Article No.: 206
Full text: PDFPDF

A MAS architecture consisting of service centers is proposed. Within each service center, a mediator coordinates service delivery by allocating individual tasks to corresponding task specialist agents depending on their prior performance while anticipating ...
Managing the pedigree and quality of information in dynamic information sharing environments
Bin Yu, Srikanth Kallurkar, Ganesh Vaidyanathan, Donald Steiner
Article No.: 207
Full text: PDFPDF

The quality of information is crucial for decision making in many mission-critical applications such as battlefield operations and intelligence analysis. However, as the system becomes larger and more diverse, it is becoming increasingly difficult to ...
Understanding decentralised control of resource allocation in a minimal multi-agent system
Mariusz Jacyno, Seth Bullock, Terry Payne, Michael Luck
Article No.: 208
Full text: PDFPDF

In response to the advent of new computational infrastructures, a number of initiatives, such as autonomic computing [5] and utility computing [8], have been announced by major IT vendors sharing the same underlying principles of provisioning ...
Developing multi-agent systems with automatic agent generation and dynamic task allocation mechanisms
Xiaoqin Zhang, Haiping Xu, Bhavesh Shrestha
Article No.: 209
Full text: PDFPDF

Multi-Agent System (MAS) is a suitable programming paradigm for distributed information systems and applications. We have been working on a set of technologies and mechanisms to ease and formalize the development of MAS, and to increase its reliability ...
Building coalitions involving agents and humans: reports from agent-based participatory simulations
Paul Guyot, Shinichi Honiden
Article No.: 210
Full text: PDFPDF

Agent-based participatory simulations are laboratory experiments designed like agent-based simulations and where humans access the simulation as software agents. This paper describes the outcomes of six experiments lasting up to two hours each, where ...
Multi-task overlapping coalition parallel formation algorithm
Chao-Feng Lin, Shan-Li Hu
Article No.: 211
Full text: PDFPDF

The issue of coalition formation has been investigated from many aspects, but until recently little attention has been paid to overlapping coalition formation. What's more, an algorithm of multi-task coalition parallel formation hasn't been proposed ...
Agents that collude to evade taxes
Luis Antunes, João Balsa, Helder Coelho
Article No.: 212
Full text: PDFPDF

We explore the link between micro-level motivations leading to and being influenced by macro-level outcomes to study the complex issue of tax evasion. If it is obvious why there is a benefit for people who evade taxes, it is less obvious why people would ...
Achieving cooperation among selfish agents in the air traffic management domain using signed money
Geert Jonker, Frank Dignum, John-Jules Meyer
Article No.: 213
Full text: PDFPDF

We present a monetary system by which selfish agents can cooperate reciprocally. We show that a straight-forward market mechanism can lead to unfair situations when agents misuse key positions. We show that it is not easy to retaliate wrongdoers, as ...
An event-driven approach for agent-based business process enactment
Payal Chakravarty, Munindar P. Singh
Article No.: 214
Full text: PDFPDF

Agents enacting business processes in large open environments need to adaptively accommodate exceptions. Work on multiagent approaches can flexibly model business processes. This paper proposes an event-driven architecture that enriches such models with ...
Executing multi-robot cases through a single coordinator
Raquel Ros, Manuela Veloso
Article No.: 215
Full text: PDFPDF

It is challenging to design general robot soccer coordination behaviors that address individual states. We have successfully followed a case-based approach to define behaviors for a single soccer robot. In our multi-robot system we now distinguish retriever ...
Distributed coordination in uncertain multiagent systems
Rajiv T. Maheswaran, Craig M. Rogers, Romeo Sanchez
Article No.: 216
Full text: PDFPDF

We consider real-time multi-agent coordination in a dynamic and uncertain domain addressing both distributed state information and partial knowledge of the common reward function. The challenge is to find functional strategies when bounded rationality ...
SESSION: Multiagent planning: full papers
Graphical models for online solutions to interactive POMDPs
Prashant Doshi, Yifeng Zeng, Qiongyu Chen
Article No.: 217
Full text: PDFPDF

We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear than the previous representation. These graphical models called interactive ...
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, Milind Tambe, Makoto Yokoo
Article No.: 218
Full text: PDFPDF

Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the significant complexity of solving distributed POMDPs, particularly as we scale ...
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Janusz Marecki, Milind Tambe
Article No.: 219
Full text: PDFPDF

Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve. In this paper, we improve a state-of-the-art heuristic solution method ...
Q-value functions for decentralized POMDPs
Frans A. Oliehoek, Nikos Vlassis
Article No.: 220
Full text: PDFPDF

Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by dynamic programming, and then a policy is extracted from this value function. ...
SESSION: Multiagent planning: poster papers
Utility-based plan recognition: an extended abstract
Dorit Avrahami-Zilberbrand, Gal A. Kaminka
Article No.: 221
Full text: PDFPDF

Plan recognition is the process of inferring other agents' plans and goals based on their observable actions. Essentially all previous work in plan recognition has focused on the recognition process itself, with no regard to the use of the information ...
Planning and defeasible reasoning
Diego R. Garcia, Alejandro J. Garcia, Guillermo R. Simari
Article No.: 222
Full text: PDFPDF

We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to construct plans using Partial Order Planning techniques.
Distributed intrusion detection in partially observable Markov decision processes
Doran Chakraborty, Sandip Sen
Article No.: 223
Full text: PDFPDF

The problem of decentralized control occurs frequently in realistic domains where agents have to cooperate to achieve a universal goal. Planning for domain-level joint strategy takes into account the uncertainty of the underlying environment in computing ...
Subjective approximate solutions for decentralized POMDPs
Anton Chechetka, Katia Sycara
Article No.: 224
Full text: PDFPDF

A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DEC-POMDPs) provide a convenient, but intractable model for specifying planning problems ...
Modeling plan coordination in multiagent decision processes
Ping Xuan
Article No.: 225
Full text: PDFPDF

In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categories: agent local problem solving activities and coordination activities, ...
SESSION: Ontologies: full papers
A formal model for situated semantic alignment
Manuel Atencia, Marco Schorlemmer
Article No.: 226
Full text: PDFPDF

Ontology matching is currently a key technology to achieve the semantic alignment of ontological entities used by knowledge-based applications, and therefore to enable their interoperability in distributed environments such as multi-agent systems. Most ...
A multi-agent system for building dynamic ontologies
Kévin Ottens, Marie-Pierre Gleizes, Pierre Glize
Article No.: 227
Full text: PDFPDF

Ontologies building from text is still a time-consuming task which justifies the growth of Ontology Learning. Our system named Dynamo is designed along this domain but following an original approach based on an adaptive multi-agent architecture. ...
Argumentation over ontology correspondences in MAS
Loredana Laera, Ian Blacoe, Valentina Tamma, Terry Payne, Jerôme Euzenat, Trevor Bench-Capon
Article No.: 228
Full text: PDFPDF

In order to support semantic interoperation in open environments, where agents can dynamically join or leave and no prior assumption can be made on the ontologies to align, the different agents involved need to agree on the semantics of the terms used ...
Learning consumer preferences using semantic similarity
Reyhan Aydoğan, Pinar Yolum
Article No.: 229
Full text: PDFPDF

In online, dynamic environments, the services requested by consumers may not be readily served by the providers. This requires the service consumers and providers to negotiate their service needs and offers. Multiagent negotiation approaches typically ...
SESSION: Ontologies: full papers
Cooperative evolution of service ontologies
Murat Şensoy, Pinar Yolum
Article No.: 230
Full text: PDFPDF

Most of the proposed approaches in automatic service selection assume the existence of a common ontology among communicating agents. However, this assumption becomes difficult to support in environments, where the agents' ontologies can evolve independently ...
An ontology-based approach to interoperability for Bayesian agents
Elder Rizzon Santos, Moser Silva Fagundes, Rosa Maria Vicari
Article No.: 231
Full text: PDFPDF

This paper presents an ontology-based approach to promote the interoperability among agents that represent their knowledge through Bayesian networks. This research relies on semantic web foundations to achieve knowledge interoperability in the context ...
Exchanging reputation values among heterogeneous agent reputation models: an experience on ART testbed
Anarosa A. F. Brandão, Laurent Vercouter, Sara Casare, Jaime Sichman
Article No.: 232
Full text: PDFPDF

In open MAS it is often a problem to achieve agents' interoperability. The heterogeneity of its components turns the establishment of interaction or cooperation among them into a non trivial task, since agents may use different internal models and the ...
SESSION: Agent learning, evolution, and adaptation: full papers
Confidence-based policy learning from demonstration using Gaussian mixture models
Sonia Chernova, Manuela Veloso
Article No.: 233
Full text: PDFPDF

We contribute an approach for interactive policy learning through expert demonstration that allows an agent to actively request and effectively represent demonstration examples. In order to address the inherent uncertainty of human demonstration, we ...
Forecasting market prices in a supply chain game
Christopher Kiekintveld, Jason Miller, Patrick R. Jordan, Michael P. Wellman
Article No.: 234
Full text: PDFPDF

Future market conditions can be a pivotal factor in making business decisions. We present and evaluate methods used by our agent, Deep Maize, to forecast market prices in the Trading Agent Competition Supply Chain Management Game. As a guiding principle ...
Conditional random fields for activity recognition
Douglas L. Vail, Manuela M. Veloso, John D. Lafferty
Article No.: 235
Full text: PDFPDF

Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we compare two models for temporal classification: hidden Markov models (HMMs), ...
SESSION: Agent learning, evolution, and adaptation: poster papers
Using priorities to simplify behavior coordination
Brent E. Eskridge, Dean F. Hougen
Article No.: 236
Full text: PDFPDF

Previous research has used behavior hierarchies to address the problem of coordinating large numbers of behaviors. However, behavior hierarchies scale poorly since they require the state information of low-level behaviors. Abstracting this state information ...
Advice taking in multiagent reinforcement learning
Michael Rovatsos, Alexandros Belesiotis
Article No.: 237
Full text: PDFPDF

This paper proposes the β-WoLF algorithm for multiagent reinforcement learning (MARL) that uses an additional "advice" signal to inform agents about mutually beneficial forms of behaviour. β-WoLF is an extension of the WoLF-PHC algorithm that ...
SESSION: Argumentation and negotiation: full papers
Children in the forest: towards a canonical problem of spatio-temporal collaboration
Yi Luo, Ladislau Bölöni
Article No.: 238
Full text: PDFPDF

Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most important challenges of the real world problems being modeled. Such examples ...
Hypotheses refinement under topological communication constraints
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzanne Pinson
Article No.: 239
Full text: PDFPDF

We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally computes its favoured hypothesis and tries to propagate it to other agents, ...
On the relevance of utterances in formal inter-agent dialogues
Simon Parsons, Peter McBurney, Elizabeth Sklar, Michael Wooldridge
Article No.: 240
Full text: PDFPDF

Work on argumentation-based dialogue has defined frameworks within which dialogues can be carried out, established protocols that govern dialogues, and studied different properties of dialogues. This work has established the space in which agents are ...
A generative inquiry dialogue system
Elizabeth Black, Anthony Hunter
Article No.: 241
Full text: PDFPDF

The majority of existing work on agent dialogues considers negotiation, persuasion or deliberation dialogues. We focus on inquiry dialogues that allow two agents to share knowledge in order to construct an argument for a specific claim. Inquiry dialogues ...
Negotiation by abduction and relaxation
Chiaki Sakama, Katsumi Inoue
Article No.: 242
Full text: PDFPDF

This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduce methods of constructing counter-proposals in response to proposals made ...
The LOGIC negotiation model
Carles Sierra, John Debenham
Article No.: 243
Full text: PDFPDF

Successful negotiators prepare by determining their position along five dimensions: Legitimacy, Options, Goals, Independence, and Commitment, (LOGIC). We introduce a negotiation model based on these dimensions and on two primitive concepts: intimacy ...
SESSION: Argumentation and negotiation: poster papers
Multi-agent information system using mobile agent negotiation based on a flexible transport ontology
Hayfa Zgaya, Slim Hammadi
Article No.: 244
Full text: PDFPDF

According to the exponential growth of services available on large distributed networks, transport customers require relevant, interactive and instantaneous information during their travels. Thus, we designed and implemented a multi-agent information ...
Negotiation partners selection mechanism based on context-dependent similarity relations
Jakub Brzostowski, Ryszard Kowalczyk
Article No.: 245
Full text: PDFPDF

This paper proposes a context-dependent case-based mechanism for selecting negotiation partners with the focus on the adaptation of similarity relations to a specific context. The similarity relations are important part of the reasoning mechanism and ...
A pareto optimal model for automated multi-attribute negotiations
Guoming Lai, Katia Sycara, Cuihong Li
Article No.: 246
Full text: PDFPDF

This paper presents an applicable model for complex multi-attribute negotiations between autonomous agents. The model adopts a novel protocol which decomposes the original n-dimensional negotiation space into a series of negotiation base lines ...
Using iterative narrowing to enable multi-party negotiations with multiple interdependent issues
Hiromitsu Hattori, Mark Klein, Takayuki Ito
Article No.: 247
Full text: PDFPDF

Multi-issue negotiations are a central part of many coordination challenges, and thus represent an important research topic. Almost all previous work in this area has assumed that negotiation issues are independent, but this is rarely the case in real-world ...
AutoMed: an automated mediator for bilateral negotiations under time constraints
Michal Chalamish, Sarit Kraus
Article No.: 248
Full text: PDFPDF

Engaging in negotiations is a daily activity. Some negotiations require the involvement of a mediator in order to be concluded in a satisfying manner. In such cases, the objective is to help the negotiators reach a mutually beneficial agreement [6, 4]. ...
Workflow coordination for service-oriented multiagent systems
Jiangbo Dang, Jingshan Huang, Michael N. Huhns
Article No.: 249
Full text: PDFPDF

From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to model a workflow and coordinate their execution of it. From a service-oriented ...
An equal excess negotiation algorithm for coalition formation
Hrishikesh J. Goradia, Jose M. Vidal
Article No.: 250
Full text: PDFPDF

Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perform with a lower efficiency. The focus of our work is on real-world application ...
SESSION: Emergent behavior: full papers
Effective tag mechanisms for evolving coordination
Matthew Matlock, Sandip Sen
Article No.: 251
Full text: PDFPDF

Tags or observable features shared by a group of similar agents are effectively used in real and artificial societies to signal intentions and can be used to infer unobservable properties and choose appropriate behaviors. Use of tags to select partners ...
Self-organizing social and spatial networks under what-if scenarios
Il-Chul Moon, Kathleen M. Carley
Article No.: 252
Full text: PDFPDF

Multi-agent models have been used to simulate complex systems in many domains. In some models, the agents move in a physical/grid space and are constrained by their locations on the spatial space, e.g. Sugarscape. In others, the agents interact in a ...
Invited talk by winner of IFAAMAS Victor Lesser Distinguished Dissertation Award
Vincent Conitzer
Article No.: 253
SESSION: Applications and computational environments: full papers
Computing the Banzhaf power index in network flow games
Yoram Bachrach, Jeffrey S. Rosenschein
Article No.: 254
Full text: PDFPDF

Preference aggregation is used in a variety of multiagent applications, and as a result, voting theory has become an important topic in multiagent system research. However, power indices (which reflect how much "real power" a voter has in a weighted ...
Distributed agent-based air traffic flow management
Kagan Tumer, Adrian Agogino
Article No.: 255
Full text: PDFPDF

Air traffic flow management is one of the fundamental challenges facing the Federal Aviation Administration (FAA) today. The FAA estimates that in 2005 alone, there were over 322,000 hours of delays at a cost to the industry in excess of three billion ...
Scaling-up shopbots: a dynamic allocation-based approach
David Sarne, Sarit Kraus, Takayuki Ito
Article No.: 256
Full text: PDFPDF

In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in demand for price comparison services over the internet and in the number of ...
SESSION: Applications and computational environments: poster papers
Locating RF emitters with large UAV teams
Paul Scerri, Robin Glinton, Sean Owens, Steven Okamoto, Katia Sycara
Article No.: 257
Full text: PDFPDF

The rapidly improving availability of small, unmanned aerial vehicles (UAVs) and their ever reducing cost is leading to considerable interest in multi-UAV applications. However, while UAVs have become smaller and cheaper, there is a lack of sensors that ...
Moving target search in grid worlds
Cagatay Undeger, Faruk Polat
Article No.: 258
Full text: PDFPDF

In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions ...
An agent-based model that relates investment in education to economic prosperity
Yuqing Tang, Simon Parsons, Elizabeth Sklar
Article No.: 259
Full text: PDFPDF

We describe work on an agent-based model that captures the relationship between the investment that a society makes in education and the outcome in terms of the health of the society's economy. In this work we created an agent-based version of an equation-based ...
An agent-based methodology for analyzing and visualizing educational assessment data
Elizabeth Sklar, Jordan Salvit, Christopher Camacho, William Liu
Article No.: 260
Full text: PDFPDF

We examine data collected from on-line assessments of the numeracy and literacy skills of young students in order to construct probabilistic agent-based controllers. We demonstrate the value of this methodology as an effective means for both analyzing ...
SESSION: Demonstration program
Agent trust evaluation and team formation in heterogeneous organizations
K. S. Barber, J. Ahn, S. Budalakoti, D. DeAngelis, K. K. Fullam, C. L. D. Jones, X. Sui
Article No.: 261
Full text: PDFPDF

This demonstration highlights different aspects of the bottom-up assembly of multi-agent teams; illustrating trust evaluation of potential partners via experience- and reputation-based trust models, multi-dimensional trust evaluation of potential partners, ...
F-trade: an agent-mining symbiont for financial services
Longbing Cao, Chengqi Zhang
Article No.: 262
Full text: PDFPDF

The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining can enhance agent learning, while agent can benefit data mining with distributed ...
Demonstration: disaster evacuation support
Christopher J. Carpenter, Robert N. Lass, Evan Sultanik, Christopher J. Dugan, Gaurav Naik, Pragnesh Jay Modi, Joseph B. Kopena, Duc N. Nguyen, William C. Regli
Article No.: 263
Full text: PDFPDF

Evacuation or sheltering of neighborhoods, cities, or regions is a major component of responding to any natural or other disaster. Poorly chosen and uncoordinated destinations can quickly overwhelm shelter capacities. Insufficient knowledge and decision ...
Demonstration of teamwork in uncertain domains using hybrid BDI-POMDP systems
Tapana Gupta, Pradeep Varakantham, Timothy W. Rauenbusch, Milind Tambe
Article No.: 264
Full text: PDFPDF

Personal Assistant agents are becoming increasingly important in a variety of application domains in offices, at home, for medical care and many others [5, 1]. These agents are required to constantly monitor their environment (including the state of ...
Creating densely populated virtual environments
Ryan McAlinden, Don Dini, Chirag Merchant, Michael van Lent
Article No.: 265
Full text: PDFPDF

Few virtual environments are capable of supporting large numbers of autonomous agents (> 5000) with complex decision-making on a single machine. This demonstration depicts such an agent infrastructure set within a game-based virtual environment. The ...
Agent-based reduction of information density (ARID) demonstration
Stephen O'Hara, Nathan Dwyer
Article No.: 266
Full text: PDFPDF

21st Century Systems, Inc. (21CSI) has developed a prototype software system that uses intelligent agents to assist in the decluttering of net-centric command and control (C2) displays. The software is called ARID, or Agent-based Reduction ...
WS-agreement based resource negotiation in AgentScape
M. A. Oey, R. J. Timmer, D. G. A. Mobach, B. J. Overeinder, F. M. T. Brazier
Article No.: 267
Full text: PDFPDF

Mobile agents require access to computing resources on heterogeneous systems across the Internet. This demo illustrates how agents can negotiate terms and conditions of resource access with one or more mediators representing virtual organizations of ...
Airspace management of autonomous UAVs
Osher Yadgar, Regis Vincent
Article No.: 268
Full text: PDFPDF

One major issue currently preventing the adoption of autonomous unmanned air vehicles (UAVs) is the lack of airspace management to prevent the UAVs from colliding with each other, with human-piloted planes or helicopters, with static objects such as ...
Emergent ad hoc sensor network connectivity in large-scale disaster zones
Osher Yadgar
Article No.: 269
Full text: PDFPDF

We introduce a disaster-zone-monitoring web-based application. While using this application, the user may simulate different large-scale disaster zones. He may use tools to define a disaster zone and its communication requirements. The web application ...
AUML protocols and code generation in the Prometheus design tool
Lin Padgham, John Thangarajah, Michael Winikoff
Article No.: 270
Full text: PDFPDF

Prometheus is an agent-oriented software engineering methodology. The Prometheus Design Tool (PDT) is a software tool that supports a designer who is using the Prometheus methodology. PDT has recently been extended with two significant ...
FearNot! demo: a virtual environment with synthetic characters to help bullying
Marco Vala, Pedro Sequeira, Ana Paiva, Ruth Aylett
Article No.: 271
Full text: PDFPDF

This demo features FearNot!, a school-based Virtual Learning Environment (VLE) populated by synthetic characters representing the various actors in a bullying scenario. FearNot! uses emergent narrative to create improvised dramas with those characters. ...
SESSION: Industry track program
Demand side management in district heating systems
Fredrik Wernstedt, Paul Davidsson, Christian Johansson
Article No.: 272
Full text: PDFPDF

This paper describes a multiagent system that has made the voyage from research project to commercialised product. The purpose for the multiagent system is to dynamically control a system so that the load of the system is below certain threshold values ...
MAGENTA technology case studies of magenta i-scheduler for road transportation
Petr Skobelev, Andrey Glaschenko, Ilya Grachev, Sergey Inozemtsev
Article No.: 273
Full text: PDFPDF

The paper describes functionality of Magenta Multi-Agent Logistics i-Scheduler Engine presented on AAMAS 2006 conferences and gives examples of its application in business domain. The i-Scheduler Engine was designed to be scalable without risk of combinatorial ...
Intelligent agent framework for order entry and management
Thuc Duong Nguyen, Simon Thompson
Article No.: 274
Full text: PDFPDF

This paper describes an agent system we have built to handle order entry and management issue in business computing and specialized in the telecommunication domain. Our system is implemented using only industry approved standards and it can both manage ...
Web services negotiation in an insurance grid
Shamimabi Paurobally, Chris van Aart, Valentina Tamma, Michael Wooldridge, Peter van Hapert
Article No.: 275
Full text: PDFPDF

There are an increasing number of initiatives for the migration of agents research towards new Internet technologies such as the semantic web, Grid, and web services. On the one hand, service oriented Grid architectures need to support dynamic cooperation, ...
The IEEE FIPA approach to integrating software agents and web services
Dominic Greenwood, Margaret Lyell, Ashok Mallya, Hiroki Suguri
Article No.: 276
Full text: PDFPDF

In many settings Web services are now perceived as the first choice technology to provide neatly encapsulated functionality for Web-based computation. To date, many standards have been produced and adoption is accelerating across numerous application ...
Multi-agent system of Samara region social services based on social passports and smart cards of citizens
Vladimir Vittikh, Elena Gritsenko, Oleg Surnin, Petr Skobelev, Denis Volhoncev, Maxim Karavaev, Mihaii Shamashov, Alexander Tsarev
Article No.: 277
Full text: PDFPDF

Paper presents multi-agent system for social services based on social passport and smart cards of citizens. It describes developed approach based on agents and ontologies, architecture of the system and its specific features. It is shown that application ...
Real-time agent characterization and prediction
H. Van Dyke Parunak, Sven Brueckner, Robert Matthews, John Sauter, Steve Brophy
Article No.: 278
Full text: PDFPDF

Reasoning about agents that we observe in the world is challenging. Our available information is often limited to observations of the agent's external behavior in the past and present. To understand these actions, we need to deduce the agent's internal ...
A multi-agent system of evidential reasoning for intelligence analyses
Eric Lindahl, Stephen O'Hara, Qiuming Zhu
Article No.: 279
Full text: PDFPDF

This paper describes a Multi-Agent System intended for assisting military commanders and intelligence analysts in the discovery and analysis of publicly available information that may have intelligence value (Open Source Intelligence, or OSINT). Our ...
Auction-based multi-robot task allocation in COMSTAR
Matthew Hoeing, Prithviraj Dasgupta, Plamen Petrov, Stephen O'Hara
Article No.: 280
Full text: PDFPDF

Over the past few years, swarm based systems have emerged as an attractive paradigm for building large scale distributed systems composed of numerous independent but coordinating units. In our previous work, we have developed a protoype system called ...
The human agent virtual environment
Michael Papasimeon, Adrian R. Pearce, Simon Goss
Article No.: 281
Full text: PDFPDF

In this paper we describe a multi-agent simulation called the Human Agent Virtual Environment (or HAVE). HAVE is a test bed to explore agent-environment interaction in multi-agent simulation for defence applications. The primary research driver in the ...

Powered by The ACM Guide to Computing Literature

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2011 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder