scholarly journals Using a Stochastic Agent Model to Optimize Performance in Divergent Interest Tacit Coordination Games

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7026
Author(s):  
Dor Mizrahi ◽  
Inon Zuckerman ◽  
Ilan Laufer
Keyword(s):  
Focal Point ◽  
Selection Process ◽  
Belief System ◽  
Behavioral Model ◽  
Mean Value ◽  
Coordination Games ◽  
Autonomous Agent ◽  
Behavioral Game Theory ◽  
Tacit Coordination ◽  
Better Than

In recent years collaborative robots have become major market drivers in industry 5.0, which aims to incorporate them alongside humans in a wide array of settings ranging from welding to rehabilitation. Improving human–machine collaboration entails using computational algorithms that will save processing as well as communication cost. In this study we have constructed an agent that can choose when to cooperate using an optimal strategy. The agent was designed to operate in the context of divergent interest tacit coordination games in which communication between the players is not possible and the payoff is not symmetric. The agent’s model was based on a behavioral model that can predict the probability of a player converging on prominent solutions with salient features (e.g., focal points) based on the player’s Social Value Orientation (SVO) and the specific game features. The SVO theory pertains to the preferences of decision makers when allocating joint resources between themselves and another player in the context of behavioral game theory. The agent selected stochastically between one of two possible policies, a greedy or a cooperative policy, based on the probability of a player to converge on a focal point. The distribution of the number of points obtained by the autonomous agent incorporating the SVO in the model was better than the results obtained by the human players who played against each other (i.e., the distribution associated with the agent had a higher mean value). Moreover, the distribution of points gained by the agent was better than any of the separate strategies the agent could choose from, namely, always choosing a greedy or a focal point solution. To the best of our knowledge, this is the first attempt to construct an intelligent agent that maximizes its utility by incorporating the belief system of the player in the context of tacit bargaining. This reward-maximizing strategy selection process based on the SVO can also be potentially applied in other human–machine contexts, including multiagent systems.

scholarly journals Autonocoin: A Proof-of-Belief Cryptocurrency

Ledger ◽  
2016 ◽  
Vol 1 ◽  
pp. 119-133 ◽  
Author(s):  
Michael Abramowicz
Keyword(s):  
Focal Point ◽  
Coordination Games ◽  
Mining Activities ◽  
Distributed Consensus ◽  
Funding Model ◽  
Client Software ◽  
Tacit Coordination ◽  
Normative Issues

This paper proposes a self-governing cryptocurrency, dubbed Autonocoin. Cryptocurrency owners play formal tacit coordination games by making investments recorded on the blockchain. Such investments represent bets about the focal point resolution of normative issues, such as whether a proposed change to Autonocoin should occur. The game produces a result that resolves the issue. With a typical cryptocurrency, the client software establishes conventions that ultimately lead to the identification of the authoritative blockchain. Autonocoin completes a circle by making transactions on the blockchain that in turn define those conventions and the expected software behavior. The distributed consensus mechanism embodied by formal tacit coordination games, meanwhile, can make other types of decisions, including which of competing blockchains is authoritative and whether new Autonocoins should be rewarded to benefit those who have taken actions to benefit Autonocoin. This establishes a unique funding model for a cryptocurrency, and it addresses objections to cryptocurrencies issued predominantly to the initial founders, as well as to those that encourage wasteful mining activities.

scholarly journals Contactless Video-Based Heart Rate Monitoring of a Resting and an Anesthetized Pig

Animals ◽  
2021 ◽  
Vol 11 (2) ◽  
pp. 442
Author(s):  
Meiqing Wang ◽  
Ali Youssef ◽  
Mona Larsen ◽  
Jean-Loup Rault ◽  
Daniel Berckmans ◽  
...  
Keyword(s):  
Heart Rate ◽  
Estimation Error ◽  
Well Being ◽  
Absolute Error ◽  
Mean Value ◽  
Video Data ◽  
Window Functions ◽  
The Face ◽  
Short Time ◽  
Better Than

Heart rate (HR) is a vital bio-signal that is relatively easy to monitor with contact sensors and is related to a living organism’s state of health, stress and well-being. The objective of this study was to develop an algorithm to extract HR (in beats per minute) of an anesthetized and a resting pig from raw video data as a first step towards continuous monitoring of health and welfare of pigs. Data were obtained from two experiments, wherein the pigs were video recorded whilst wearing an electrocardiography (ECG) monitoring system as gold standard (GS). In order to develop the algorithm, this study used a bandpass filter to remove noise. Then, a short-time Fourier transform (STFT) method was tested by evaluating different window sizes and window functions to accurately identify the HR. The resulting algorithm was first tested on videos of an anesthetized pig that maintained a relatively constant HR. The GS HR measurements for the anesthetized pig had a mean value of 71.76 bpm and standard deviation (SD) of 3.57 bpm. The developed algorithm had 2.33 bpm in mean absolute error (MAE), 3.09 bpm in root mean square error (RMSE) and 67% in HR estimation error below 3.5 bpm (PE3.5). The sensitivity of the algorithm was then tested on the video of a non-anaesthetized resting pig, as an animal in this state has more fluctuations in HR than an anaesthetized pig, while motion artefacts are still minimized due to resting. The GS HR measurements for the resting pig had a mean value of 161.43 bpm and SD of 10.11 bpm. The video-extracted HR showed a performance of 4.69 bpm in MAE, 6.43 bpm in RMSE and 57% in PE3.5. The results showed that HR monitoring using only the green channel of the video signal was better than using three color channels, which reduces computing complexity. By comparing different regions of interest (ROI), the region around the abdomen was found physiologically better than the face and front leg parts. In summary, the developed algorithm based on video data has potential to be used for contactless HR measurement and may be applied on resting pigs for real-time monitoring of their health and welfare status, which is of significant interest for veterinarians and farmers.

Research on Material Selection with Multi-Attribute Decision Method and G1 Method

2014 ◽  
Vol 952 ◽  
pp. 20-24 ◽  
Author(s):  
Xue Jun Xie
Keyword(s):  
Material Selection ◽  
Selection Process ◽  
Selection Problem ◽  
Topsis Method ◽  
Attribute Weight ◽  
Multi Attribute Decision Making ◽  
Judgment Matrix ◽  
Optimal Material ◽  
Selection Of ◽  
Better Than

The selection of an optimal material is an important aspect of design for mechanical, electrical, thermal, chemical or other application. Many factors (attributes) need to be considered in material selection process, and thus material selection problem is a multi-attribute decision making (MADM) problem. This paper proposes a new MADM method for material selection problem. G1 method does not need to test consistency of the judgment matrix. Thus it is better than AHP. In this paper, firstly, we use the G1 method to determine the attribute weight. Then TOPSIS method is used to calculate the closeness of the candidate materials with respect positive solution. A practical material selection case is used to demonstrate the effectiveness and feasibility of the proposed method.

To the problem of uncertainty in interpolation of annual runoff

2012 ◽  
Vol 43 (6) ◽  
pp. 833-850 ◽  
Author(s):  
Ziqi Yan ◽  
Lars Gottschalk ◽  
Irina Krasovskaia ◽  
Jun Xia
Keyword(s):  
Cross Validation ◽  
Drainage Basin ◽  
Annual Runoff ◽  
Mean Value ◽  
Regular Grid ◽  
Main River ◽  
Average Annual Runoff ◽  
The One ◽  
Better Than

The long-term mean value of runoff is the basic descriptor of available water resources. This paper focuses on the accuracy that can be achieved when mapping this variable across space and along main rivers for a given stream gauging network. Three stochastic interpolation schemes for estimating average annual runoff across space are evaluated and compared. Two of the schemes firstly interpolate runoff to a regular grid net and then integrate the grid values along rivers. One of these schemes includes a constraint to account for the lateral water balance along the rivers. The third scheme interpolates runoff directly to points along rivers. A drainage basin in China with 20 gauging sites is used as a test area. In general, all three approaches reproduce the sample discharges along rivers with postdiction errors along main river branches around 10%. Using more objective cross-validation results, it was found that the two schemes based on basin integration, and especially the one with a constraint, performed significantly better than the one with direct interpolation to points along rivers. The analysis did not allow identification of possible influence of surface water use.

scholarly journals A networked voting rule for democratic representation

2018 ◽  
Vol 5 (3) ◽  
pp. 172265 ◽  
Author(s):  
Alexis R. Hernández ◽  
Carlos Gracia-Lázaro ◽  
Edgardo Brigatti ◽  
Yamir Moreno
Keyword(s):  
Large Scale ◽  
Selection Process ◽  
General Relation ◽  
Community Size ◽  
Rule Based ◽  
Voting Rule ◽  
Large Populations ◽  
Negative Effect ◽  
High Connectivity ◽  
Better Than

We introduce a general framework for exploring the problem of selecting a committee of representatives with the aim of studying a networked voting rule based on a decentralized large-scale platform, which can assure a strong accountability of the elected. The results of our simulations suggest that this algorithm-based approach is able to obtain a high representativeness for relatively small committees, performing even better than a classical voting rule based on a closed list of candidates. We show that a general relation between committee size and representatives exists in the form of an inverse square root law and that the normalized committee size approximately scales with the inverse of the community size, allowing the scalability to very large populations. These findings are not strongly influenced by the different networks used to describe the individuals’ interactions, except for the presence of few individuals with very high connectivity which can have a marginal negative effect in the committee selection process.

scholarly journals Some External Characteristics of the Gala and Bozakh Sheep Native Breeds and Their Hybrids

2021 ◽  
Vol 7 (12) ◽  
pp. 87-91
Author(s):  
Q. Abdullayev ◽  
I. Farajullayeva
Keyword(s):  
Selection Process ◽  
Native Breed ◽  
The Village ◽  
External Characteristics ◽  
Better Than

In Azerbaijan, sheep mating is natural in both small and large sheep farms and very little attention is paid to the selection process. For industrial crossing of local sheep (western part of the country), five breeding rams of 1.5 years old were purchased in the village of Gala (Absheron) and delivered to the Gaji Tagi farm in the Dashkesan district. Two groups were formed from a native herd of 100 sheep each. Fertilization of females was carried out from October 15 to December 1. According to the indexing data, the external signs of the native breed of Bozakh sheep are better than those of other similar breeds. From the results obtained, it should be concluded that the livestock of Gala and Bozakh breeds can be adapted to the foothills of Azerbaijan.

scholarly journals A User-Centric QoS-Based Web Service Selection Framework

2021 ◽  
Author(s):  
Delnavaz Mobedpour
Keyword(s):  
Query Language ◽  
Focal Point ◽  
Selection Process ◽  
Service Selection ◽  
Mixed Integer ◽  
User Support ◽  
Web Service Selection ◽  
Selection Framework ◽  
Description Languages ◽  
The One

With the proliferation of web services, the selection process, especially the one based on the non-functional properties (e.g. Quality of Service – QoS attributes) has become a more and more important step to help requestors locate a desired service. There have been many research works proposing various QoS description languages and selection models. However, the end user is not generally the focal point of their designs and the user support is either missing or lacking in these systems. The QoS language sometimes is not flexible enough to accommodate users’ various requirements and is too complex so that it puts extra burden on users. In order to solve this problem, in this thesis we design a more expressive and flexible QoS query language (QQL) targeted for non-expert users, together with the user support on formulating queries and understanding services in the registry. An enhanced selection model based on Mixed Integer Programming (MIP) is also proposed to handle the QQL queries. We performed experiments with a real QoS dataset to show the effectiveness of our framework.

scholarly journals MODIFIKASI BARU ALGORITMA KOLONI LEBAH BUATAN UNTUK MASALAH OPTIMASI GLOBAL

2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono
Keyword(s):  
Food Source ◽  
Artificial Bee Colony ◽  
Selection Process ◽  
Optimization Technique ◽  
Food Sources ◽  
Abc Algorithm ◽  
Average Value ◽  
Bee Colony ◽  
Objective Function Values ◽  
Better Than

Artificial Bee Colony (ABC) algorithm is one of metaheuristic optimization technique based on population. This algorithm mimicking honey bee swarm to find the best food source. ABC algorithm consist of four phases: initialization phase, employed bee phase, onlooker bee phase and scout bee phase. This study modify the onlooker bee phase in selection process to find the neighborhood food source. Not all food sources obtained are randomly sought the neighborhood as in ABC algorithm. Food sources are selected by comparing their objective function values. The food sources that have value lower than average value in that iteration will be chosen by onlooker bee to get the better food source. In this study the modification of this algorithm is called New Modification of Artificial Bee Colony Algorithm (MB-ABC). MB-ABC was applied to 4 Benchmark functions. The results show that MB-ABC algorithm better than ABC algorithm

Sign in / Sign up

Export Citation Format

Share Document