Stefan K. Behfar (March 4th 2020). Importance of Social Networks for Knowledge Sharing and the Impact of Collaboration on Network Innovation in Online Communities, Harnessing Knowledge, Innovation and Competence in Engineering of Mission Critical Systems, Ali G. Hessami, IntechOpen, DOI: 10.5772/intechopen.89605.

Hélder Tiago da Silva Lopes, Paula Cristina Almeida Cadima Remoaldo and Vitor Ribeiro (November 5th 2018). The Use of Photos of the Social Networks in Shaping a New Tourist Destination: Analysis of Clusters in a GIS Environment, Spatial Analysis, Modelling and Planning, Jorge Rocha and José António Tenedório, IntechOpen, DOI: 10.5772/intechopen.78598. 

Alireza Chakeri, Nasser Sadati and Guy A. Dumont (March 27th 2013). Nash Equilibrium Strategies in Fuzzy Games, Game Theory Relaunched, Hardy Hanappi, IntechOpen, DOI: 10.5772/54677. 

New Zealand

We study the problem of two competing camps aiming to maximize the adoption of their respective opinions, by optimally investing in nodes of a social network in two phases. The final opinion of a node in phase 1 acts as its bias in phase 2, and this bias determines the effectiveness of a camp&#39;s investment on the node. Using an extension of Friedkin-Johnsen model of opinion dynamics, we formulate the camps&#39; utility functions. We show the existence and polynomial time computability of Nash equilibrium under reasonable assumptions. Using simulations, we quantify the effects of the nodes&#39; biases and the weightage attributed to them, as well as that of a camp deviating from its equilibrium strategy.


AAMAS 2020

A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-23 is the Thirty-Seventh AAAI Conference on Artificial Intelligence. The theme of this conference is to create collaborative bridges within and beyond AI. Like previous AAAI conferences, AAAI-23 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and two new activities: a Bridge Program and a Lab Program. Many of these activities are tailored to the theme of bridges and all are selected according to the highest standards, with additional programs for students and young researchers. 
AAAI is providing you with a conference planner, which you can use to help organize your itinerary of activities. This includes talks to attend in person, talks to attend remotely, breaks with colleagues and your site seeing activities. To access this conference planner, please go to [https://aaai-2023.takemobi.io](https://aaai-2023.takemobi.io).

In order to access this site, you need to register. If you haven't already, please register [here](https://aaai.org/Conferences/AAAI-23/registration/).


AAAI 2023

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines.

We study the problem of two competing camps aiming to maximize the adoption of their respective opinions, by optimally investing in nodes of a social network in two phases. The final opinion of a node in phase 1 acts as its bias in phase 2, and this bias determines the effectiveness of a camp's investment on the node. Using an extension of Friedkin-Johnsen model of opinion dynamics, we formulate the camps' utility functions. We show the existence and polynomial time computability of Nash equilibrium under reasonable assumptions. Using simulations, we quantify the effects of the nodes' biases and the weightage attributed to them, as well as that of a camp deviating from its equilibrium strategy.


technical paper

AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). The aim of the joint conference is to provide a single, high-profile, internationally-respected archival forum for scientific research in the theory and practice of autonomous agents and multi-agent systems.

Browse keynotes, discussions, panels and over 300 presentations.


AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). 

We define noisy combinatorial markets, a specific class of combinatorial markets and introduce a model to study them. We present a learning methodology we developed to learn competitive equilibria of noisy combinatorial markets. We summarize preliminary experimental results to evaluate the performance of our learning algorithms.


Learning Competitive Equilibria  in Noisy Combinatorial Markets

This talk describes a policy search approach for railway scheduling using the covariance matrix adaptation evolution strategy (CMA-ES). The goal is to define arrival/departure times and track allocations for all trains such that the resource and operating constraints of the railway line are satisfied, and priority-weighted train departure delay is minimised. The proposed approach is scalable in the sense that (i) the optimised policy can be applied to an arbitrarily long railway line, independent of the number of trains, tracks, and stations, and (ii) the on-line implementation is computationally light enough to be applied in real-time. Our experiments show that policies computed with CMA-ES are able to produce solutions with lower priorityweighted delay than heuristics and reinforcement learning (RL) algorithms reported in literature, on synthetic examples as well as actual railway line data from portions of the Indian Railway network.

Optimising a Real-Time Scheduler for Railway Lines using Policy Search

Robustness is an important property of software systems, and the availability of proper feedback is seen as crucial to obtain it, especially in the case of systems of distributed and interconnected components.
Multiagent Systems (MAS) are valuable for conceptualizing and implementing distributed systems, but the current design methodologies for MAS fall short in addressing robustness in a systematic way at design time.
In this paper we outline our vision of how robustness in MAS can be granted as a design property. To this end, we exploit the notion of accountability as a mechanism for building reporting frameworks and, then, we describe how robustness is gained.
We exemplify our vision on the JaCaMo agent platform.

Fragility and Robustness in Multiagent Systems

Reinforcement learning requires exploration, leading to repeated execution of sub-optimal actions. Naive exploration techniques address this problem by changing gradually from exploration to exploitation. This approach employs a wide search resulting in exhaustive exploration and low sample-efficiency. More advanced search methods explore optimistically based on an upper bound estimate of expected rewards. These methods employ deep search, aiming to reach states not previously visited. Another deep search strategy is found in action-elimination methods, which aim to discover and eliminate sub-optimal actions. Despite the effectiveness of advanced deep search strategies, some problems are better suited to naive exploration. We devise a new method, called Interval Q-Learning, that finds a balance between wide and deep search. It assigns a small probability to taking sub-optimal actions and combines both greedy and optimistic exploration. This allows for fast convergence to a near-optimal policy, and then exploration around it. We demonstrate the performance of tabular and deep Q-network versions of Interval Q-Learning, showing that it offers convergence speed-up both in problems that favor wide exploration methods and those that favor deep search strategies.


Interval Q-Learning: Balancing Deep and Wide Exploration

Epidemics of infectious diseases are an important threat to public health and global economies. 
Yet, the development of prevention strategies remains a challenging process.
For this reason, we investigate a deep reinforcement learning approach to automatically learn prevention strategies in an epidemiological model, in the context of pandemic influenza.
To this end, we construct a new epidemiological meta-population model, with 379 patches, that balances between model complexity and computational efficiency such that the use of reinforcement learning techniques becomes attainable.
First, we set up a ground truth such that we can evaluate the performance of the ""Proximal Policy Optimization"" algorithm to learn in a single district of this epidemiological model.
Next, we consider a larger scale problem, by conducting an experiment where we aim to learn a joint policy to control the districts in a community of 11 tightly coupled districts, for which no ground truth can be established. 
This experiment shows that deep reinforcement learning can be used to learn mitigation policies in complex epidemiological models with a large state space.
Moreover, through this experiment, we demonstrate that there can be an advantage to consider collaboration between districts when designing prevention strategies.


Deep reinforcement learning for large-scale epidemic control

Reward Redistribution Mechanism in Multi-Agent Reinforcement Learning

Option discovery and skill acquisition frameworks are integral to the functioning of a hierarchically organized Reinforcement learning agent. However, such techniques often yield a large number of options or skills, which can be represented succinctly by filtering out any redundant information. Such a reduction can decrease the required computation while also improving the performance on a target task. To compress an array of option policies, we attempt to find a policy basis that accurately captures the set of all options. In this work, we propose Option Encoder, an auto-encoder based framework with intelligently constrained weights, that helps discover a collection of basis policies. The policy basis can be used as a proxy for the original set of skills in a suitable hierarchically organized framework. We demonstrate the efficacy of our method on a collection of grid-worlds and Deepmind-lab by evaluating the obtained policy basis on downstream tasks.


Option Encoder : A framework for Discovering a Policy Basis in Reinforcement Learning

Electric power sharing among households based on the bidding method is studied as a future service. In order to verify the feasibility of such a service, a new multi-agent simulation model has been designed. We validated this model through some evaluations. For example, it is confirmed that the market price on this service stably changes according to the supply-demand balance between both sold and purchased bid volumes. In addition to that, the results of the household profit and contract rate of this service showed that the design for bid strategies works as intended in most cases.


Design and Evaluations of Multi-Agent Simulation Model for Electric Power Sharing among Households

We present a reinforcement learning-based approach for generating a timetable for trains traversing through a railway station.
We demonstrate how the reinforcement learning approach is used to learn heuristics, which in turn are used to generate a train movement plan.
We compare the quality of the plan generated using ‘rules used in practice’ and the plan generated by the ‘heuristics learned using the RL approach’, under different congestion scenarios
"


Reinforcement Learning for Train Movement Planning at Railway Stations

We study proportionality in approval-based multi- winner elections with a variable number of winners, where both the size and identity of the winning committee are informed by voters’ opinions. While proportionality has been studied in multi- winner elections with a fixed number of winners, it has not been considered in the variable number of winners setting. The measure of proportionality we consider is average satisfaction (AS), which intuitively measures the number of agreements on aver- age between sufficiently large and cohesive groups of voters and the output of the voting rule. First, we show an upper bound on the AS that any deterministic rule can provide, and that straightforward adaptations of deterministic rules from the fixed number of winners setting do not achieve better than a 1/2 approximation to AS even for large numbers of candidates. We then prove that a natural randomized rule achieves a 29/32 approximation to AS.


A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks

Downloads

Next from AAMAS 2020

Learning Competitive Equilibria  in Noisy Combinatorial Markets

Similar lecture

On the Vulnerability of Backdoor Defenses for Federated Learning

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAMAS 2020

Learning Competitive Equilibria in Noisy Combinatorial Markets

Similar lecture

On the Vulnerability of Backdoor Defenses for Federated Learning

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads

Learning Competitive Equilibria  in Noisy Combinatorial Markets