Author: Takahiro Uchiya
Publisher: Springer Nature
ISBN: 3030693228
Category : Computers
Languages : en
Pages : 430
Book Description
This book constitutes the refereed proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, held in Nagoya, Japan, in November 2020. The 19 full papers presented and 13 short papers were carefully reviewed and selected from 50 submissions. Due to COVID-19, the conference was held online. The conference covers a wide range of ranging from foundations of agent theory and engineering aspects of agent systems, to emerging interdisciplinary areas of agent-based research.
PRIMA 2020: Principles and Practice of Multi-Agent Systems
Author: Takahiro Uchiya
Publisher: Springer Nature
ISBN: 3030693228
Category : Computers
Languages : en
Pages : 430
Book Description
This book constitutes the refereed proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, held in Nagoya, Japan, in November 2020. The 19 full papers presented and 13 short papers were carefully reviewed and selected from 50 submissions. Due to COVID-19, the conference was held online. The conference covers a wide range of ranging from foundations of agent theory and engineering aspects of agent systems, to emerging interdisciplinary areas of agent-based research.
Publisher: Springer Nature
ISBN: 3030693228
Category : Computers
Languages : en
Pages : 430
Book Description
This book constitutes the refereed proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, held in Nagoya, Japan, in November 2020. The 19 full papers presented and 13 short papers were carefully reviewed and selected from 50 submissions. Due to COVID-19, the conference was held online. The conference covers a wide range of ranging from foundations of agent theory and engineering aspects of agent systems, to emerging interdisciplinary areas of agent-based research.
PRIMA 2022: Principles and Practice of Multi-Agent Systems
Author: Reyhan Aydoğan
Publisher: Springer Nature
ISBN: 3031212037
Category : Computers
Languages : en
Pages : 714
Book Description
This book constitutes the refereed proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, held in hybrid mode in Valencia, Spain, in November 2022. The 31 full papers presented together with 15 short papers and 1 demo paper were carefully reviewed and selected from 100 submissions. The conference covers a wide range of ranging from foundations of agent theory and engineering aspects of agent systems, to emerging interdisciplinary areas of agent-based research.
Publisher: Springer Nature
ISBN: 3031212037
Category : Computers
Languages : en
Pages : 714
Book Description
This book constitutes the refereed proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, held in hybrid mode in Valencia, Spain, in November 2022. The 31 full papers presented together with 15 short papers and 1 demo paper were carefully reviewed and selected from 100 submissions. The conference covers a wide range of ranging from foundations of agent theory and engineering aspects of agent systems, to emerging interdisciplinary areas of agent-based research.
PRIMA 2018: Principles and Practice of Multi-Agent Systems
Author: Tim Miller
Publisher: Springer
ISBN: 3030030989
Category : Computers
Languages : en
Pages : 687
Book Description
This book constitutes the refereed proceedings of the 21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018, held in Tokyo, Japan, in October/November 2018. The 27 full papers presented and 31 short papers were carefully reviewed and selected from 103 submissions. PRIMA presents subjects in many application domains, particularly in e-commerce, and also in planning, logistics, manufacturing, robotics, decision support, transportation, entertainment, emergency relief and disaster management, and data mining and analytics.
Publisher: Springer
ISBN: 3030030989
Category : Computers
Languages : en
Pages : 687
Book Description
This book constitutes the refereed proceedings of the 21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018, held in Tokyo, Japan, in October/November 2018. The 27 full papers presented and 31 short papers were carefully reviewed and selected from 103 submissions. PRIMA presents subjects in many application domains, particularly in e-commerce, and also in planning, logistics, manufacturing, robotics, decision support, transportation, entertainment, emergency relief and disaster management, and data mining and analytics.
PRIMA 2019: Principles and Practice of Multi-Agent Systems
Author: Matteo Baldoni
Publisher: Springer Nature
ISBN: 3030337928
Category : Computers
Languages : en
Pages : 660
Book Description
This book constitutes the refereed proceedings of the 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019, held in Turin, Italy, in October 2019. The 25 full papers presented and 25 short papers were carefully reviewed and selected from 112 submissions. The papers presented at the PRIMA 2019 conference focus on the following topics: Logic and Reasoning, Engineering Multi-Agent Systems, Agent-Based Modeling and Simulation, Collaboration and Coordination, Economic Paradigms, Human-Agent Interaction, Decentralized Paradigms, and Application Domains for Multi-Agent Systems.
Publisher: Springer Nature
ISBN: 3030337928
Category : Computers
Languages : en
Pages : 660
Book Description
This book constitutes the refereed proceedings of the 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019, held in Turin, Italy, in October 2019. The 25 full papers presented and 25 short papers were carefully reviewed and selected from 112 submissions. The papers presented at the PRIMA 2019 conference focus on the following topics: Logic and Reasoning, Engineering Multi-Agent Systems, Agent-Based Modeling and Simulation, Collaboration and Coordination, Economic Paradigms, Human-Agent Interaction, Decentralized Paradigms, and Application Domains for Multi-Agent Systems.
Autonomous Agents and Multiagent Systems. Best and Visionary Papers
Author: Francisco S. Melo
Publisher: Springer Nature
ISBN: 3031201795
Category : Computers
Languages : en
Pages : 151
Book Description
This book constitutes thoroughly refereed and revised selected best and visionary papers from the Workshops held at the International Conference on Autonomous Agents and Multiagent Systems AAMAS 2022, which took place online, during May 9–13, 2022. The 5 best papers and 4 visionary papers included in this book stem from the following workshops: - 13th Workshop on Optimization and Learning in Multi-agent Systems (OptLearnMAS);- 23rd Workshop on Multi-Agent Based Simulation (MABS);- 6th Workshop on Agent-Based Modelling of Urban Systems (ABMUS);- 10th Workshop on Engineering Multi-Agent Systems (EMAS);- 1st Workshop on Rebellion and Disobedience in AI (RaD-AI). There was a total of 59 submissions to these workshops.
Publisher: Springer Nature
ISBN: 3031201795
Category : Computers
Languages : en
Pages : 151
Book Description
This book constitutes thoroughly refereed and revised selected best and visionary papers from the Workshops held at the International Conference on Autonomous Agents and Multiagent Systems AAMAS 2022, which took place online, during May 9–13, 2022. The 5 best papers and 4 visionary papers included in this book stem from the following workshops: - 13th Workshop on Optimization and Learning in Multi-agent Systems (OptLearnMAS);- 23rd Workshop on Multi-Agent Based Simulation (MABS);- 6th Workshop on Agent-Based Modelling of Urban Systems (ABMUS);- 10th Workshop on Engineering Multi-Agent Systems (EMAS);- 1st Workshop on Rebellion and Disobedience in AI (RaD-AI). There was a total of 59 submissions to these workshops.
Dividing the Indivisible
Author: Fredrik Präntare
Publisher: Linköping University Electronic Press
ISBN: 9180756018
Category :
Languages : en
Pages : 184
Book Description
Allocating resources, goods, agents (e.g., humans), expertise, production, and assets is one of the most influential and enduring cornerstone challenges at the intersection of artificial intelligence, operations research, politics, and economics. At its core—as highlighted by a number of seminal works [181, 164, 125, 32, 128, 159, 109, 209, 129, 131]—is a timeless question: How can we best allocate indivisible entities—such as objects, items, commodities, jobs, or personnel—so that the outcome is as valuable as possible, be it in terms of expected utility, fairness, or overall societal welfare? This thesis confronts this inquiry from multiple algorithmic viewpoints, focusing on the value-maximizing combinatorial assignment problem: the optimization challenge of partitioning a set of indivisibles among alternatives to maximize a given notion of value. To exemplify, consider a scenario where an international aid organization is responsible for distributing medical resources, such as ventilators and vaccines, and allocating medical personnel, including doctors and nurses, to hospitals during a global health crisis. These resources and personnel—inherently indivisible and non-fragmentable—necessitate an allocation process designed to optimize utility and fairness. Rather than using manual interventions and ad-hoc methods, which often lack precision and scalability, a rigorously developed and demonstrably performant approach can often be more desirable. With this type of challenge in mind, our thesis begins through the lens of computational complexity theory, commencing with an initial insight: In general, under prevailing complexity-theoretic assumptions (P ≠ NP), it is impossible to develop an efficient method guaranteeing a value-maximizing allocation that is better than “arbitrarily bad”, even under severely constraining limitations and simplifications. This inapproximability result not only underscores the problem’s complexity but also sets the stage for our ensuing work, wherein we develop novel algorithms and concise representations for utilitarian, egalitarian, and Nash welfare maximization problems, aimed at maximizing average, equitable, and balanced utility, respectively. For example, we introduce the synergy hypergraph—a hypergraph-based characterization of utilitarian combinatorial assignment—which allows us to prove several new state-of-the-art complexity results to help us better understand how hard the problem is. We then provide efficient approximation algorithms and (non-trivial) exponential-time algorithms for many hard cases. In addition, we explore complexity bounds for generalizations with interdependent effects between allocations, known as externalities in economics. Natural applications in team formation, resource allocation, and combinatorial auctions are also discussed; and a novel “bootstrapped” dynamic-programming method is introduced. We then transition from theory to practice as we shift our focus to the utilitarian variant of the problem—an incarnation of the problem particularly applicable to many real-world scenarios. For this variation, we achieve substantial empirical algorithmic improvements over existing methods, including industry-grade solvers. This work culminates in the development of a new hybrid algorithm that combines dynamic programming with branch-and-bound techniques that is demonstrably faster than all competing methods in finding both optimal and near-optimal allocations across a wide range of experiments. For example, it solves one of our most challenging problem sets in just 0.25% of the time required by the previous best methods, representing an improvement of approximately 2.6 orders of magnitude in processing speed. Additionally, we successfully integrate and commercialize our algorithm into Europa Universalis IV—one of the world’s most popular strategy games, with a player base exceeding millions. In this dynamic and challenging setting, our algorithm efficiently manages complex strategic agent interactions, highlighting its potential to improve computational efficiency and decision-making in real-time, multi-agent scenarios. This also represents one of the first instances where a combinatorial assignment algorithm has been applied in a commercial context. We then introduce and evaluate several highly efficient heuristic algorithms. These algorithms—while lacking provable quality guarantees—employ general-purpose heuristic and random-sampling techniques to significantly outperform existing methods in both speed and quality in large-input scenarios. For instance, in one of our most challenging problem sets, involving a thousand indivisibles, our best algorithm generates outcomes that are 99.5% of the expected optimal in just seconds. This performance is particularly noteworthy when compared to state-of-the-art industry-grade solvers, which struggle to produce any outcomes under similar conditions. Further advancing our work, we employ novel machine learning techniques to generate new heuristics that outperform the best hand-crafted ones. This approach not only showcases the potential of machine learning in combinatorial optimization but also sets a new standard for combinatorial assignment heuristics to be used in real-world scenarios demanding rapid, high-quality decisions, such as in logistics, real-time tactics, and finance. In summary, this thesis bridges many gaps between the theoretical and practical aspects of combinatorial assignment problems such as those found in coalition formation, combinatorial auctions, welfare-maximizing resource allocation, and assignment problems. It deepens the understanding of the computational complexities involved and provides effective and improved solutions for longstanding real-world challenges across various sectors—providing new algorithms applicable in fields ranging from artificial intelligence to logistics, finance, and digital entertainment, while simultaneously paving the way for future work in computational problem-solving and optimization.
Publisher: Linköping University Electronic Press
ISBN: 9180756018
Category :
Languages : en
Pages : 184
Book Description
Allocating resources, goods, agents (e.g., humans), expertise, production, and assets is one of the most influential and enduring cornerstone challenges at the intersection of artificial intelligence, operations research, politics, and economics. At its core—as highlighted by a number of seminal works [181, 164, 125, 32, 128, 159, 109, 209, 129, 131]—is a timeless question: How can we best allocate indivisible entities—such as objects, items, commodities, jobs, or personnel—so that the outcome is as valuable as possible, be it in terms of expected utility, fairness, or overall societal welfare? This thesis confronts this inquiry from multiple algorithmic viewpoints, focusing on the value-maximizing combinatorial assignment problem: the optimization challenge of partitioning a set of indivisibles among alternatives to maximize a given notion of value. To exemplify, consider a scenario where an international aid organization is responsible for distributing medical resources, such as ventilators and vaccines, and allocating medical personnel, including doctors and nurses, to hospitals during a global health crisis. These resources and personnel—inherently indivisible and non-fragmentable—necessitate an allocation process designed to optimize utility and fairness. Rather than using manual interventions and ad-hoc methods, which often lack precision and scalability, a rigorously developed and demonstrably performant approach can often be more desirable. With this type of challenge in mind, our thesis begins through the lens of computational complexity theory, commencing with an initial insight: In general, under prevailing complexity-theoretic assumptions (P ≠ NP), it is impossible to develop an efficient method guaranteeing a value-maximizing allocation that is better than “arbitrarily bad”, even under severely constraining limitations and simplifications. This inapproximability result not only underscores the problem’s complexity but also sets the stage for our ensuing work, wherein we develop novel algorithms and concise representations for utilitarian, egalitarian, and Nash welfare maximization problems, aimed at maximizing average, equitable, and balanced utility, respectively. For example, we introduce the synergy hypergraph—a hypergraph-based characterization of utilitarian combinatorial assignment—which allows us to prove several new state-of-the-art complexity results to help us better understand how hard the problem is. We then provide efficient approximation algorithms and (non-trivial) exponential-time algorithms for many hard cases. In addition, we explore complexity bounds for generalizations with interdependent effects between allocations, known as externalities in economics. Natural applications in team formation, resource allocation, and combinatorial auctions are also discussed; and a novel “bootstrapped” dynamic-programming method is introduced. We then transition from theory to practice as we shift our focus to the utilitarian variant of the problem—an incarnation of the problem particularly applicable to many real-world scenarios. For this variation, we achieve substantial empirical algorithmic improvements over existing methods, including industry-grade solvers. This work culminates in the development of a new hybrid algorithm that combines dynamic programming with branch-and-bound techniques that is demonstrably faster than all competing methods in finding both optimal and near-optimal allocations across a wide range of experiments. For example, it solves one of our most challenging problem sets in just 0.25% of the time required by the previous best methods, representing an improvement of approximately 2.6 orders of magnitude in processing speed. Additionally, we successfully integrate and commercialize our algorithm into Europa Universalis IV—one of the world’s most popular strategy games, with a player base exceeding millions. In this dynamic and challenging setting, our algorithm efficiently manages complex strategic agent interactions, highlighting its potential to improve computational efficiency and decision-making in real-time, multi-agent scenarios. This also represents one of the first instances where a combinatorial assignment algorithm has been applied in a commercial context. We then introduce and evaluate several highly efficient heuristic algorithms. These algorithms—while lacking provable quality guarantees—employ general-purpose heuristic and random-sampling techniques to significantly outperform existing methods in both speed and quality in large-input scenarios. For instance, in one of our most challenging problem sets, involving a thousand indivisibles, our best algorithm generates outcomes that are 99.5% of the expected optimal in just seconds. This performance is particularly noteworthy when compared to state-of-the-art industry-grade solvers, which struggle to produce any outcomes under similar conditions. Further advancing our work, we employ novel machine learning techniques to generate new heuristics that outperform the best hand-crafted ones. This approach not only showcases the potential of machine learning in combinatorial optimization but also sets a new standard for combinatorial assignment heuristics to be used in real-world scenarios demanding rapid, high-quality decisions, such as in logistics, real-time tactics, and finance. In summary, this thesis bridges many gaps between the theoretical and practical aspects of combinatorial assignment problems such as those found in coalition formation, combinatorial auctions, welfare-maximizing resource allocation, and assignment problems. It deepens the understanding of the computational complexities involved and provides effective and improved solutions for longstanding real-world challenges across various sectors—providing new algorithms applicable in fields ranging from artificial intelligence to logistics, finance, and digital entertainment, while simultaneously paving the way for future work in computational problem-solving and optimization.
Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics. The PAAMS Collection
Author: Philippe Mathieu
Publisher: Springer Nature
ISBN: 3031376161
Category : Computers
Languages : en
Pages : 450
Book Description
This book constitutes the proceedings of the 21st International Conference on Practical Applications of Agents and Multi-Agent Systems, PAAMS 2023, held in Guimaraes, Portugal, in July 2023. The 32 full papers in this book were reviewed and selected from 70 submissions. 5 demonstration papers are also included in this volume. The papers deal with the application and validation of agent-based models, methods, and technologies in a number of key applications areas, including: advanced models and learning, agent-based programming, decision-making, education and social interactions, formal and theoretic models, health and safety, mobility and the city, swarms and task allocation.
Publisher: Springer Nature
ISBN: 3031376161
Category : Computers
Languages : en
Pages : 450
Book Description
This book constitutes the proceedings of the 21st International Conference on Practical Applications of Agents and Multi-Agent Systems, PAAMS 2023, held in Guimaraes, Portugal, in July 2023. The 32 full papers in this book were reviewed and selected from 70 submissions. 5 demonstration papers are also included in this volume. The papers deal with the application and validation of agent-based models, methods, and technologies in a number of key applications areas, including: advanced models and learning, agent-based programming, decision-making, education and social interactions, formal and theoretic models, health and safety, mobility and the city, swarms and task allocation.
Engineering Multi-Agent Systems
Author: Daniela Briola
Publisher: Springer Nature
ISBN: 3031711521
Category :
Languages : en
Pages : 204
Book Description
Publisher: Springer Nature
ISBN: 3031711521
Category :
Languages : en
Pages : 204
Book Description
ECAI 2020
Author: G. De Giacomo
Publisher: IOS Press
ISBN: 164368101X
Category : Computers
Languages : en
Pages : 3122
Book Description
This book presents the proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), held in Santiago de Compostela, Spain, from 29 August to 8 September 2020. The conference was postponed from June, and much of it conducted online due to the COVID-19 restrictions. The conference is one of the principal occasions for researchers and practitioners of AI to meet and discuss the latest trends and challenges in all fields of AI and to demonstrate innovative applications and uses of advanced AI technology. The book also includes the proceedings of the 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) held at the same time. A record number of more than 1,700 submissions was received for ECAI 2020, of which 1,443 were reviewed. Of these, 361 full-papers and 36 highlight papers were accepted (an acceptance rate of 25% for full-papers and 45% for highlight papers). The book is divided into three sections: ECAI full papers; ECAI highlight papers; and PAIS papers. The topics of these papers cover all aspects of AI, including Agent-based and Multi-agent Systems; Computational Intelligence; Constraints and Satisfiability; Games and Virtual Environments; Heuristic Search; Human Aspects in AI; Information Retrieval and Filtering; Knowledge Representation and Reasoning; Machine Learning; Multidisciplinary Topics and Applications; Natural Language Processing; Planning and Scheduling; Robotics; Safe, Explainable, and Trustworthy AI; Semantic Technologies; Uncertainty in AI; and Vision. The book will be of interest to all those whose work involves the use of AI technology.
Publisher: IOS Press
ISBN: 164368101X
Category : Computers
Languages : en
Pages : 3122
Book Description
This book presents the proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), held in Santiago de Compostela, Spain, from 29 August to 8 September 2020. The conference was postponed from June, and much of it conducted online due to the COVID-19 restrictions. The conference is one of the principal occasions for researchers and practitioners of AI to meet and discuss the latest trends and challenges in all fields of AI and to demonstrate innovative applications and uses of advanced AI technology. The book also includes the proceedings of the 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) held at the same time. A record number of more than 1,700 submissions was received for ECAI 2020, of which 1,443 were reviewed. Of these, 361 full-papers and 36 highlight papers were accepted (an acceptance rate of 25% for full-papers and 45% for highlight papers). The book is divided into three sections: ECAI full papers; ECAI highlight papers; and PAIS papers. The topics of these papers cover all aspects of AI, including Agent-based and Multi-agent Systems; Computational Intelligence; Constraints and Satisfiability; Games and Virtual Environments; Heuristic Search; Human Aspects in AI; Information Retrieval and Filtering; Knowledge Representation and Reasoning; Machine Learning; Multidisciplinary Topics and Applications; Natural Language Processing; Planning and Scheduling; Robotics; Safe, Explainable, and Trustworthy AI; Semantic Technologies; Uncertainty in AI; and Vision. The book will be of interest to all those whose work involves the use of AI technology.
Self-organising Multi-agent Systems: Algorithmic Foundations Of Cyber-anarcho-socialism
Author: Jeremy Pitt
Publisher: World Scientific
ISBN: 1800610440
Category : Computers
Languages : en
Pages : 400
Book Description
The paradigm of self-organisation is fundamental to theories of collective action in economic science and democratic governance in political science. Self-organisation in these social systems critically depends on voluntary compliance with conventional rules: that is, rules which are made up, mutually agreed, and modifiable 'on the fly'. How, then, can we use the self-organisation observed in such social systems as an inspiration for decentralised computer systems, which can face similar problems of coordination, cooperation and collaboration between autonomous peers?Self-Organising Multi-Agent Systems presents an innovative and systematic approach to transforming theories of economics and politics (and elements of philosophy, psychology, and jurisprudence) into an executable logical specification of conventional rules. It shows how sets of such rules, called institutions, provide an algorithmic basis for designing and implementing cyber-physical systems, enabling intelligent software processes (called agents) to manage themselves in the face of competition for scarce resources. It also provides a basis for implementing socio-technical systems with interacting human and computational intelligences in a way that is sustainable, fair and legitimate.This interdisciplinary book is essential reading for anyone interested in the 'planned emergence' of global properties, commonly-shared values or successful collective action, especially as a product of social construction, knowledge management and political arrangements. For those studying both computer science and social sciences, this book offers a radically new gateway to a transformative understanding of complex system development and social system modelling.Understanding how a computational representation of qualitative values like justice and democracy can lead to stability and legitimacy of socio-technical systems is among the most pressing software engineering challenges of modern times. This book can be read as an invitation to make the Digital Society better.Related Link(s)
Publisher: World Scientific
ISBN: 1800610440
Category : Computers
Languages : en
Pages : 400
Book Description
The paradigm of self-organisation is fundamental to theories of collective action in economic science and democratic governance in political science. Self-organisation in these social systems critically depends on voluntary compliance with conventional rules: that is, rules which are made up, mutually agreed, and modifiable 'on the fly'. How, then, can we use the self-organisation observed in such social systems as an inspiration for decentralised computer systems, which can face similar problems of coordination, cooperation and collaboration between autonomous peers?Self-Organising Multi-Agent Systems presents an innovative and systematic approach to transforming theories of economics and politics (and elements of philosophy, psychology, and jurisprudence) into an executable logical specification of conventional rules. It shows how sets of such rules, called institutions, provide an algorithmic basis for designing and implementing cyber-physical systems, enabling intelligent software processes (called agents) to manage themselves in the face of competition for scarce resources. It also provides a basis for implementing socio-technical systems with interacting human and computational intelligences in a way that is sustainable, fair and legitimate.This interdisciplinary book is essential reading for anyone interested in the 'planned emergence' of global properties, commonly-shared values or successful collective action, especially as a product of social construction, knowledge management and political arrangements. For those studying both computer science and social sciences, this book offers a radically new gateway to a transformative understanding of complex system development and social system modelling.Understanding how a computational representation of qualitative values like justice and democracy can lead to stability and legitimacy of socio-technical systems is among the most pressing software engineering challenges of modern times. This book can be read as an invitation to make the Digital Society better.Related Link(s)