PRIMA 2015: Principles and Practice of Multi-Agent Systems

Name: PRIMA 2015: Principles and Practice of Multi-Agent Systems | 18th International Conference, Bertinoro, Italy, October 26-30, 2015, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

18th International Conference, Bertinoro, Italy, October 26-30, 2015, Proceedings

Qingliang Chen Paolo Torroni Serena Villata Jane Hsu Andrea Omicini(Editor)

Springer (Publisher)

Published on 20. October 2015

XXI, 708 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-25524-8 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Contents
Regular Papers
Solving F3MDPs: Collaborative Multiagent Markov Decision Processes with Factored Transitions, Rewards and Stochastic Policies
1 Introduction
2 Background
2.1 FA-FMDP
2.2 Related Work in Collaborative Multiagent MDPs
3 F3MDP
3.1 Stochastic Factored Policies and F3MDP
3.2 Optimizing Stochastic Factored Policies in F3MDP
3.3 Approximate Policy Iteration Algorithms
4 Experiments
4.1 Policy Evaluation Methods
4.2 Small F3MDP Problems
4.3 Large Random Problems
4.4 Large Disease Management Problems
5 Concluding Remarks
References
Managing Autonomous Mobility on Demand Systems for Better Passenger Experience
1 Introduction
2 Related Work
2.1 Autonomous Vehicles
2.2 Mobility on Demand Systems
2.3 Autonomous Mobility on Demand Systems
3 Managing Autonomous Mobility on Demand Systems
3.1 Scheduling Strategies
3.2 The Expand and Target Algorithm
3.3 Integration
3.4 The Autonomous Mobility on Demand Simulation Platform
4 Experimental Analysis
4.1 Evaluation Metrics
4.2 The Datasets
4.3 Experimental Settings
4.4 Experimental Results
5 Conclusion and Future Work
References
Norm Establishment in a Single Dimension Axelrod Model
1 Introduction
2 Axelrod's Norm Model
3 Characterisation of Evolutionary Stable States (ESSs)
4 Model Description
5 Experiments and Results
6 Conclusion
References
Multi-agent Systems Meet Aggregate Programming: Towards a Notion of Aggregate Plan
1 Introduction
2 Aggregate Computing
2.1 Computing at the Aggregate Level
2.2 Constructs
2.3 Building Blocks and APIs
3 Aggregate Computing and Multi-agent Systems
3.1 Multi-agent Systems vs Aggregate Computing
3.2 Aggregate Programs as Collective Plans
4 Case Study
4.1 An Aggregate Computing Approach
4.2 Simulation
5 Related MAS Approaches
6 Conclusion and Future Works
References
CAMP-BDI: A Pre-emptive Approach for Plan Execution Robustness in Multiagent Systems
1 Introduction
2 Motivating Example
3 Architecture Components
3.1 Capabilities
3.1.1 Capability Typology
3.1.2 The Confidence Function
3.2 Obligation and Dependency Contracts
3.3 Maintenance Policies
4 The CAMP-BDI Algorithm
4.1 Maintenance Tasks
4.2 Agenda Formation
4.3 Handling Maintenance Tasks
4.3.1 Performing Preconditions Maintenance
4.3.2 Performing Effects Maintenance
5 Distributed Behaviour
6 Evaluation
7 Related Work
8 Conclusion
References
Optimizing Long-Running Action Histories in the Situation Calculus Through Search
1 Situation Calculus Basic Action Theories
2 Transforming Extended Action Sequences
3 A Rewriting System and Search Framework
4 A Case of DBs with Disjunctive Information
5 An Offline Precomputing Step
6 Basic Optimization Scenarios
7 Related and Future Work
8 Conclusions
References
Semantics for Modelling Reason-Based Preferences
1 Introduction
2 A Logic for Reason-Based Preferences
3 Sequence Semantics
4 Choice Consistency: Contraction and Expansion
5 Soundness Results
5.1 System E
6 Semantic Completeness
6.1 Completeness of E
7 Conclusion and Related Work
References
Strategy-Proof Cake Cutting Mechanisms for All-or-Nothing Utility
1 Introduction
2 Related Works
3 Preliminaries
3.1 Model
3.2 Properties
4 Incompatibility
5 SP and PE Cake Cutting Mechanisms
5.1 Randomized Serial Dictatorship Mechanism
5.2 Sorted Serial Dictatorship Mechanism
6 Integer Programming for Determining Pareto Efficient Allocation
7 Approximate Allocation Algorithm
8 Envy-Free Cake Cutting Mechanism
9 Proportionality in Expectation
10 Experimental Simulations
11 Conclusion
References
Leximin Asymmetric Multiple Objective DCOP on Factor Graph
1 Introduction
2 Preliminary
2.1 DCOP
2.2 Factor Graph, Max-Sum Algorithm and Bounded Max-Sum Algorithm
2.3 Multiple Objective DCOP for Preferences of Agents
3 Solution Methods for Leximin AMODCOPs on Factor Graphs
3.1 Dynamic Programming Based on Pseudo Tree
3.2 Approximation Method
3.3 Local Search
4 Evaluation
4.1 Settings
4.2 Results
5 Related Works and Discussions
6 Conclusions
References
Dynamic Coalition Formation in Energy Micro-Grids
1 Introduction
2 Related Work
3 Problem Model
4 System Model
5 Simulation Results
5.1 Experimental Setup
5.2 Results
6 Conclusion and Future Work
References
On the Hierarchical Nature of Partial Preferences
1 Introduction
2 Motivating Scenarios
3 Classical Preferences
4 Partial Preferences
5 Common Properties of Partial Preferences
6 The Justification Axiom
7 Related Works
8 Conclusions
References
Verification of Asynchronous Mobile-Robots in Partially-Known Environments
1 Introduction
2 Background: Automata Theory
3 The Model of Robot Systems
4 Reasoning about Robot Systems
4.1 Undecidability of Multi-Robot Systems on a Line
4.2 Decidability of Multi-Robot Systems with Bounded Switching
5 Discussion
References
Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms
1 Introduction
2 Four Behavior Types in Juvenile Honeybees
3 Mathematical Model of the Behavior Types
3.1 Individual Behavior
3.2 Social Behavior
3.3 Evolution of Parameters for Behavior Types
4 Setup of Experiments
5 Evolution of Behavior Type Compositions
6 Results
7 Discussion
8 Conclusion
References
Multi-agent Path Planning in Known Dynamic Environments
1 Introduction
1.1 Related Work
2 Representation of the Path-Planning Problem
3 Complexity of the Path-Planning Problem
4 Comparison with Other Representations
5 Summary and Future Work
References
Module Checking for Uncertain Agents
1 Introduction
2 Verification of Open Multi-Agent Systems
2.1 Models and Modules
2.2 Multi-Agent Modules
2.3 Module Checking
2.4 Reasoning about Strategic Behavior: Alternating Time Logic
2.5 Module Checking of ATL* Specifications
3 Imperfect Information
3.1 Handling Environments with Imperfect Information
3.2 Imperfect Information Module Checking
4 Expressive Power of Imperfect Information Module Checking
5 Algorithms and Complexity
6 Conclusions
References
Towards Systematic Evaluation of Multi-agent Systems in Large Scale and Dynamic Logistics
1 Introduction
2 Related Work
2.1 Centralized Algorithms
2.2 Multi-Agent Systems
3 Dynamic Pickup-and-Delivery Problems
3.1 Formal Definition
3.2 Dynamism
3.3 Urgency
3.4 Scale
4 Dataset
4.1 Scenario Generator
4.2 Benchmark Dataset
5 Demonstration
5.1 Heuristics
5.2 Centralized Algorithm
5.3 Contract Net Protocol Multi-Agent System
5.4 Results and Analysis
6 Conclusion
References
Paraconsistent Multi-party Persuasion in TalkLOG
1 Requirements for Resolving Conflicts via Persuasion
2 Related Work
3 4QL as an Implementation Tool
4 Persuasion in TalkLOG
4.1 Locutions and Moves
4.2 Dialogue Stores
4.3 Move and Locution Relevance
4.4 Working Example
5 Selected Properties
5.1 Soundness, Completeness and Convergence to Merged Outcome
6 Conclusions
References
A Micro Study on the Evolution of Arguments in Amazon.com's Reviews
1 Introduction
2 Literature Review
3 Abstract Argumentation Frameworks and Tools
4 Dataset
5 Analysis
6 A Computational Perspective
7 Discussion and Conclusions
References
The Long-Term Benefits of Following Fairness Norms: A Game-Theoretic Analysis
1 Introduction
2 Game-Theoretic Model of Guilt Aversion
2.1 Normative Game and Guilt-dependent Utility
2.2 Fairness Norms
3 Dynamic Extension
4 Mathematical Analysis in the PD with Fairness Norm à la Rawls
5 Computational Results in the PD with Fairness Norm à la Rawls
6 Tournaments and Experimental Results
7 Conclusion and Perspectives
References
Using Preferences in Negotiations over Ontological Correspondences
1 Introduction
2 The Correspondence Inclusion Dialogue
2.1 Ontologies, Correspondences and Beliefs
2.2 The Inquiry Dialogue Moves
2.3 Alignment Ambiguities
3 Dialogue Properties
4 Inquiry Dialogue Example
5 Arguing about Correspondence Inclusion
6 Discussion
7 Conclusions
References
Designing a Source-Level Debugger for Cognitive Agent Programs
1 Introduction
2 Issues in Debugging Cognitive Agent Programs
2.1 Debugging and Program Comprehension
2.2 Challenges in Designing a Source-Level Debugger
2.3 Languages and Debugging Tools for Cognitive Agents
3 Design Approach for a Debugger for Cognitive Agents
3.1 Principles and Requirements
3.2 Designing a Stepping Diagram
3.3 Evaluation
4 Conclusions and Future Work
References
Reflecting on Agent Programming with AgentSpeak(L)
1 Introduction
2 Relating AgentSpeak(L) to OOP
3 Exploring the Implications
3.1 Beliefs are Like Fields
3.2 Plans Rules as Methods
3.3 Intentions as Threads
3.4 Events are Like Messages
4 ASTRA: AgentSpeak(L) with Bells and Whistles
4.1 The ASTRA Type System
4.2 Extended Plan Syntax
4.3 Mutual Exclusion Support
5 Evaluation
6 Conclusions
References
Checking the Reliability of Information Sources in Recommendation Based Trust Decision Making
1 Introduction
2 Previous Work
3 Our Proposed Model
3.1 Task Domain
3.2 Agents' Characteristics
3.3 Self-Adaptive Agent Organization
3.4 Recommendation-Based Trust
3.5 Agents' Queue Reprioritization Using Agent' Strategy
3.6 Evaluating Neighbors for Task Delegation Purposes
3.7 Sources of False Data and Reliability Checking Mechanisms
4 Experiments and Results
4.1 What is the Effect of Anti-bias Filtering in System's Profit?
4.2 Does Anti-bias Filtering Always Help?
4.3 How Does Being Selective in Gathering Recommendation Help?
5 Conclusion and Future Work
References
Supporting Human-Robot Teams in Space Missions Using ePartners and Formal Abstraction Hierarchies
1 Introduction
2 ePartners
3 Scenario and Requirements
4 Reasoning through Abstraction Levels
5 Implementation
6 Pilot Experiment
7 Discussion
References
Flexible Reward Plans for Crowdsourced Tasks
1 Introduction
2 Related Work
3 Preliminaries
4 Generalized Strictly Proper Scoring Rules
4.1 Generalized Spherical/Quadratic Rules
4.2 Relations with Kernel and Continuous Ranked Probability Scores
5 Comparison Between the Original and Our Proposed Rules
6 Experimental Evaluations
6.1 Task of Predicting Highest Temperature
6.2 Task of Predicting Exchange Rate Movements
7 Conclusion
References
Majoritarian Group Actions
1 Introduction
2 Background on Judgment Aggregation
3 Background on Substructural Logics
3.1 Hilbert System for ILLD
3.2 Models of ILL
4 Linear Bringing-it-about Logic with Coalitions (Linear BIAT C)
4.1 Axioms of Linear BIAT C
4.2 Models of Linear BIAT C
4.3 Soundness and Completeness
5 Aggregative View of Group Attitudes
6 Conclusion
References
Programming Deliberation Strategies in Meta-APL
1 Introduction
2 Specifying Deliberation Strategies
3 Meta-APL
3.1 Meta-APL Syntax
3.2 Meta-APL Core Deliberation Cycle
4 Encoding Deliberation Strategies
4.1 Non-interleaved (ni)
4.2 Alternating (Single Action) (as)
4.3 Alternating (Multi-action) (am)
5 An Adaptive Deliberation Strategy
6 Related Work
7 Conclusion
References
Multi-Context Systems with Preferences
1 Introduction
2 Background
2.1 Multi-Context Systems
2.2 Logic Programs Under Answer Set Semantics (ASP)
2.3 Answer Set Optimization (ASO)
2.4 CR-Prolog
3 Ranked Logics
4 MCS with Preferences and Its Applications
4.1 MCS with Preferences
4.2 Distributed Configuration Problems as MCSP
4.3 Distributed Diagnosis and MCSP
5 Discussion
6 Conclusions and Future Works
References
A Dynamic-Logical Characterization of Solutions in Sight-Limited Extensive Games
1 Introduction
2 Game Theoretical Notions
2.1 Extensive Game with Short Sight
2.2 Solutions for Egss
3 Dynamic Logic for Short Sight
3.1 Syntax and Semantics
3.2 Axiomatization: Expressing Properties
4 Characterizing Solutions
5 Soundness and Completeness
6 Discussion and Conclusion
References
Early Innovation Papers
Kinetic Description of Opinion Evolution in Multi-agent Systems: Analytic Model and Simulations
1 Introduction
2 Kinetic Model of Opinion Formation
3 Stationary Behaviour of Opinion Distribution
4 Conclusions
References
An Agent-Based Model to Study Effects of Team Processes on Compliance with Safety Regulations at an Airline Ground Service Organization
1 Introduction
2 Theoretical Background
3 The Agent-Based Model
4 Simulation Study
5 Discussion and Conclusions
References
Agent-Oriented Programming Languages as a High-Level Abstraction Facilitating the Development of Intelligent Behaviours for Component-Based Applications
1 Introduction
2 Background
2.1 OSGi
2.2 SIXTH
2.3 WAIST
3 Agent-Oriented Programming Languages
3.1 Environment Abstraction
3.2 ASTRA
4 Integration
4.1 Basic Functionality
4.2 Expanded Functionality in WAIST
5 Evaluation
5.1 Problems
5.2 Participants
5.3 Results
5.4 Survey
6 Conclusions and Future Work
References
Towards a Taxonomy of Task-Oriented Domains of Dialogue
1 Introduction
2 Related Work
3 Taxonomy
3.1 Finding Dimensions of Task-Oriented Domains
3.2 Creating a Taxonomy
4 Examples
5 Conclusions and Further Work
References
Mechanism Design for Argumentation-Based Information-Seeking and Inquiry
1 Introduction
2 Background and Preliminaries
3 Information Seeking Dialogues
4 Inquiry Dialogues
5 Conclusions
References
Fair Assessment of Group Work by Mutual Evaluation with Irresponsible and Collusive Students Using Trust Networks
1 Introduction
2 Model and Issues
3 Fair Assessment Using Cluster-Trust and Collusion Strategies
3.1 Initial Trust Network by Submitted Evaluations
3.2 Cluster-Trust Value
3.3 Iterative Calculation of Cluster Values and Trust Networks
3.4 Strategies Against Collusive Students
4 Experiments
4.1 Experimental Setup
4.2 Experimental Results and Discussion
5 Conclusion
References
Modeling the Effects of Personality on Team Formation in Self-assembly Teams
1 Introduction
2 Personality
3 Proposed Team formation mechanism
4 Experiments and Results
5 Validation
6 Conclusion
References
Real-Time Conditional Commitment Logic
1 Introduction
2 Extended Version of Interpreted Systems and RTCTLcc
3 Related Work
4 Conclusion
References
A Double Auction Mechanism for On-Demand Transport Networks
1 Introduction
2 System Model
2.1 Commuter Preferences
2.2 Driver Preferences
3 Proposed Market Mechanism
3.1 Sub-Market Decomposition
3.2 Double Auction Mechanism
3.3 Mechanism Properties
4 Simulation Results
5 Conclusions
References
Exploiting Social Commitments in Programming Agent Interaction
1 Introduction
2 Social Commitments for Programming
3 JaCaMo+
4 JaCaMo+ Gold Miners
5 Conclusions
References
Social Continual Planning in Open Multiagent Systems: A First Study
1 Introduction
2 Related Work and Background
3 The Social Continual Planning Problem
4 Discussion and Conclusions
References
Security Games with Ambiguous Beliefs of Agents
1 Introduction
2 Background
3 Methods and Materials
4 Experiments
5 Conclusion and Future Work
References
Introducing Preference-Based Argumentation to Inconsistent Ontological Knowledge Bases
1 Introduction
2 Knowledge Representation
2.1 Argumentation
3 Preference Handling
4 Preference Ranking
5 Theoretical Evaluation
6 Qualitative Evaluation
7 Conclusion and Related Work
References
Compliant Business Processes with Exclusive Choices from Agent Specification
1 Introduction
2 Logic
3 Algorithms
4 Conclusion and Related Work
References
Probabilistic Perception Revision in AGENTSPEAK(L)
1 Introduction and Motivation
1.1 State of the Art
2 Probabilistic Perception Correction
3 Results
4 Conclusion
References
Adaptive Multi-stage Optimisation for EV Charging Integration into Smart Grid Control
1 Introduction and Problem Statement
2 System Architecture
3 Implementation of Optimisation Stages
3.1 Stage 1: Vehicle Availability Prediction
3.2 Stage 3: Meta-Heuristic Optimisation of the Schedule
4 Evaluation
4.1 Booking Prognoses
4.2 Charge Scheduling Optimisation
5 Conclusion
References
Collaborative Judgement
1 Introduction
2 Collaborative Judgement
3 The SAWA Algorithm
4 Evaluation
4.1 Experimental Setting
5 Discussion
6 Conclusions and Further Work
References
Model Checking Resource Bounded Systems with Shared Resources via Alternating Büchi Pushdown Systems
1 Introduction and Related Work
2 Resource Agent Logic
3 Model Checking CTL over Büchi Pushdown Systems
3.1 Alternating Büchi Pushdown Systems
3.2 Model Checking CTL Over ABPDSs
4 (Un-)Decidable Model Checking Result
5 Conclusions
References
Integrating Conversation Trees and Cognitive Models Within an ECA for Aggression De-escalation Training
1 Introduction
2 Aggression De-escalation Training
3 Dialogue System
4 Integration with a Cognitive Model
5 Practical Application
6 Discussion
References
Checking WELTLK Properties of Weighted Interpreted Systems via SMT-Based Bounded Model Checking
1 Introduction
2 Preliminaries
3 SMT-Based Bounded Model Checking
3.1 Bounded Semantics
3.2 Translation to SMT
4 Experimental Results
4.1 Performance Evaluation
5 Conclusions
References
Games with Communication: From Belief to Preference Change
1 Introduction
2 Games and Announcements
3 Belief Revision: From Announcements to Beliefs
4 Voting: From Beliefs to Preferences
5 A Logic for Strategies, Announcements and Preferences
6 Example
7 Conclusion
References
Design Patterns for Environments in Multi-agent Simulations
1 Introduction
2 Formalizing the Concept of Environment
2.1 First Purpose: Placing Agents
2.2 Second Purpose: Providing Information
3 Four Fundamental Patterns
3.1 The ``AgentSet'' Pattern
Principle.
Advantages and Drawbacks.
Usages.
3.2 The ``StandardGrid'' Pattern
Principle.
Advantages and Drawbacks.
Usages.
3.3 The ``AggregateGrid'' Pattern
Principle.
Advantages and Drawbacks.
Usages.
3.4 The ``SocialNet'' Pattern
Principle.
Advantages and Drawbacks.
Usages.
4 Combining Patterns
5 Conclusion and Perspectives
References
Commitments, Expectations, Affordances and Susceptibilities: Towards Positional Agent Programming
1 Introduction
1.1 Background and Motivation
2 Modeling Language: Positions and Negations
3 Cognitive Components
3.1 Commitment
3.2 Expectation
3.3 Affordance
3.4 Susceptibility
4 Operationalization
4.1 From Commitment to Action
4.2 From Commitment to Monitoring
5 Discussion and Further Developments
References
Using Conceptual Spaces for Object Recognition in Multi-agent Systems
1 Introduction
2 BDI Architecture, Conceptual Spaces, and Related Computational Platforms
3 Integration of a Conceptual Space Model into the Reasoning Cycle of BDI Agents
4 A Practical Example of the Use of Conceptual Information in Multi-agent Systems
5 Conclusion
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

PRIMA 2015: Principles and Practice of Multi-Agent Systems

Description

More details

Other editions

Additional editions

Content

System requirements