Journal articles: 'Static Agents'

1

Juniastuti, Susi, Moch Fachri, Supeno Mardi Susiki Nugroho, and Mochamad Hariadi. "Inert and mobile agents navigation interaction using reciprocal velocity obstacles for collisions avoidance." Indonesian Journal of Electrical Engineering and Computer Science 26, no. 2 (May 1, 2022): 1116. http://dx.doi.org/10.11591/ijeecs.v26.i2.pp1116-1124.

Full text

Abstract:

Reciprocal velocity obstacles (RVO) is a method used for multiagents navigation that enables collision and oscillation-free avoidance against other mobile agents. Despite its ability in collision avoidance between agents, RVO has a hard time dealing with static obstacle avoidance. This problem has led to a tendency to use RVO only for agents avoidance and use other methods to handle static obstacles avoidance. In this paper, we present our new approach for interaction between mobile agents against static obstacles in the RVO based collision avoidance. We propose a concept called inert agents that interact as static obstacles. This inert agent is stand firm as static obstacles should be, while the inert agent also able to satisfy reactive collision avoidance nature of RVO to produce better avoidance result. We conduct an experiment to compare the performance of avoidance in a certain scenario. Our method shows better results when compared with generic static obstacles.

APA, Harvard, Vancouver, ISO, and other styles

2

Chitnis, Parag V., Paul Lee, Jonathan Mamou, and Jeffrey A. Ketterling. "Response of ultrasound contrast agents to static overpressure." Journal of the Acoustical Society of America 126, no. 4 (2009): 2175. http://dx.doi.org/10.1121/1.3248484.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

INADA, Yoshinori, Saburo MATSUKI, Kinutada YOKOTA, and Koji TANIGUCHI. "Basic Research on Static Crushing by Utilizing Expansive Agents." Journal of the Mining Institute of Japan 104, no. 1204 (1988): 337–43. http://dx.doi.org/10.2473/shigentosozai1953.104.1204_337.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Berger, Jean, Nassirou Lo, and Mohamed Barkaoui. "Static target search path planning optimization with heterogeneous agents." Annals of Operations Research 244, no. 2 (March 7, 2016): 295–312. http://dx.doi.org/10.1007/s10479-016-2145-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Doval, Laura. "Dynamically stable matching." Theoretical Economics 17, no. 2 (2022): 687–724. http://dx.doi.org/10.3982/te4187.

Full text

Abstract:

I introduce a stability notion, dynamic stability, for two‐sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one‐to‐one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available to match at the same time, one must establish which agents are allowed to form blocking pairs. Second, dynamic matching markets exhibit a form of externality that is not present in static markets: an agent's payoff from remaining unmatched cannot be defined independently of other contemporaneous agents' outcomes. Dynamically stable matchings always exist. Dynamic stability is a necessary condition to ensure timely participation in the economy by ensuring that agents do not strategically delay the time at which they are available to match.

APA, Harvard, Vancouver, ISO, and other styles

6

Chitnis, Parag V., Paul Lee, Jonathan Mamou, John S. Allen, and Jeffrey A. Ketterling. "Response of polymer‐shelled ultrasound contrast agents to static overpressure." Journal of the Acoustical Society of America 128, no. 4 (October 2010): 2441. http://dx.doi.org/10.1121/1.3508727.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gorbaneva, Olga Ivanovna. "Economic corruption in a static model of a combination of general and private interests." Вопросы безопасности, no. 1 (January 2022): 21–34. http://dx.doi.org/10.25136/2409-7543.2022.1.33483.

Full text

Abstract:

The article is devoted to the study of corruption in the previously studied static model of the combination of general and private interests (SOCHI model) of several agents. In this article, special attention is paid to the study of economic corruption. To do this, an intermediate level is introduced into the previously considered two-level system between the Principal and the Agents - a supervisor who represents the interests of the Principal, but in exchange for a bribe can improve the position of the agent at the expense of the Principal. The latter sets for each agent, himself and the supervisor a share of participation in the total income. The supervisor can increase the agent's share in exchange for a bribe, reducing the Principal's share. This article examines a three-level hierarchical system in which the supervisor uses an economic corruption mechanism, in the study of which two approaches are used: descriptive and optimization. The descriptive approach assumes that the functions of bribery in question are known. The optimization approach involves the use of Hermeyer's theorem. The influence of economic corruption on systemic consistency in the SOCHI model is investigated: it is proved that economic corruption can theoretically increase consistency. But this requires the fulfillment of many conditions, the joint fulfillment of which is unlikely. It is proved that economic corruption is always beneficial for agents, and also for the supervisor. The only way to combat this kind of corruption has been found.

APA, Harvard, Vancouver, ISO, and other styles

8

Chambers, Christopher P., and M. Bumin Yenmez. "Choice and Matching." American Economic Journal: Microeconomics 9, no. 3 (August 1, 2017): 126–47. http://dx.doi.org/10.1257/mic.20150236.

Full text

Abstract:

We study path-independent choice rules applied to a matching context. We use a classic representation of these choice rules to introduce a powerful technique for matching theory. Using this technique, we provide a deferred acceptance algorithm for many-to-many matching markets with contracts and study its properties. Next, we obtain a compelling comparative static result: if one agent's choice expands, the remaining agents on her side of the market are made worse off, while agents on the other side of the market are made better off. Finally, we establish several results related to path-independent choice rules. (JEL C78, D11, D71, D86)

APA, Harvard, Vancouver, ISO, and other styles

9

Jian, Yu Mei, and Ming Chen. "A Multi-Agent Cooperation System Structure for GWSN." Applied Mechanics and Materials 321-324 (June 2013): 523–27. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.523.

Full text

Abstract:

According to the characteristics of GWSN, a Multi-Agent cooperation system structure of GWSN is put forward based on the complexity and changeableness of water area and biologic growth. In this structure, the Agent is divided into mobile Agent and static Agent. Static Agent is responsible for collecting data, and mobile Agent is responsible for move between clusters. Each cluster cooperation agents are responsible for data transmission and the data fusion process is divided into four levels. It manages greenhouse wireless measurement and control system by distributed agents’ information timely interaction and cooperation.

APA, Harvard, Vancouver, ISO, and other styles

10

Daszczuk, Wiktor B. "Static and Dynamic Verification of Space Systems Using Asynchronous Observer Agents." Sensors 21, no. 13 (July 2, 2021): 4541. http://dx.doi.org/10.3390/s21134541.

Full text

Abstract:

Formal verification of distributed systems is essential, especially in mission-critical systems that cannot be restarted. Such are space systems in which satellites read sensor values and autonomously make actuator decisions based on them, and ground services only set general patterns of behavior. The verification formalism should correspond to the essential characteristics of a distributed system, such as node autonomy and asynchrony of actions and communication, as in our Integrated Model of Distributed Systems (IMDS). It is also crucial that the formalism allows for finding partial deadlocks and checking partial termination, where only a subset of the system nodes is involved while the rest can perform their own tasks at the same time. This article presents the idea of using monitoring agents—observers prepared in the IMDS formalism. Observers check the state of individual system components by polling, allowing verification without knowing the global state of the system. Such an agent is an ideal prototype of a runtime observer that checks if the actual operation of the system corresponds to a design that has previously been proven correct.

APA, Harvard, Vancouver, ISO, and other styles

11

CHEN, QIMING, PARVATHI CHUNDI, UMESHWAR DAYAL, and MEICHUN HSU. "DYNAMIC AGENTS." International Journal of Cooperative Information Systems 08, no. 02n03 (June 1999): 195–223. http://dx.doi.org/10.1142/s0218843099000101.

Full text

Abstract:

We claim that a dynamic agent infrastructure can provide a shift from static distributed computing to dynamic distributed computing, and we have developed an infrastructure to realize such a shift. We shall compare this infrastructure with other distributed computing infrastructures such as CORBA and DCOM, and demonstrate its value in highly dynamic system integration, service provisioning and distributed applications such as data mining on the Web. The infrastructure is Java-based, light-weight, and extensible. It differs from other agent platforms and client/server infrastructures in its support of dynamic behavior modification of agents. A dynamic agent is not designed to have a fixed set of predefined functions, but instead, to carry application-specific actions, which can be loaded and modified on the fly. This allows a dynamic agent to adjust its capability to accommodate changes in the environment and requirements, and play different roles across multiple applications. The above features are supported by the light-weight, built-in management facilities of dynamic agents, which can be commonly used by the "carried" application programs to communicate, manage resources and modify their problem-solving capabilities. Therefore, the proposed infrastructure allows application-specific multi-agent systems to be developed easily on top of it, provides "nuts and bolts" for run-time system integration, and supports dynamic service construction, modification and movement. A prototype has been developed at HP Labs and made available to several external research groups.

APA, Harvard, Vancouver, ISO, and other styles

12

Che, Yeon-Koo, and Seung-Weon Yoo. "Optimal Incentives for Teams." American Economic Review 91, no. 3 (June 1, 2001): 525–41. http://dx.doi.org/10.1257/aer.91.3.525.

Full text

Abstract:

Much of the existing theory of incentives describes a static relationship that lasts for just one transaction. This static assumption is not only unrealistic, but the resulting predictions appear to be at odds with many work organizations. The current paper introduces possible long-term interaction among agents, and studies how the design of explicit incentives and work organizations can exploit, and interact with, the implicit incentives generated by the repeated interaction of the agents. The optimal incentive scheme is shown to display observed features of the increasingly popular “teams,” such as the use of low-powered, group incentives. (JEL D23, J33, J41, L23)

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Li, and Fei Qiao. "A Swarm Intelligence Based Rescheduling Method for Semiconductor Wafer Fabrication Facilities." Applied Mechanics and Materials 48-49 (February 2011): 123–26. http://dx.doi.org/10.4028/www.scientific.net/amm.48-49.123.

Full text

Abstract:

An effective rescheduling method takes an important role on improving the operational performance of a semiconductor wafer fabrication facility (fabs). In this paper, we propose a rescheduling method based on swarm intelligence. Firstly, we build a swarm intelligence based rescheduling model (SIRM) including an ant queen agent, multiple job ant agents and machine ant agents. Secondly, we design a rescheduling algorithm (CMRA) composed of three sub-algorithms: sub-algorithm-1 is used by an ant queen agent to transfer an existing static optimized scheduling plan into additional pheromones of job ant agents; sub-algorithm-2 and sub-algorithm-3 are used to convert scheduling related real-time information to dynamic pheromones of job ant agents and machine ant agents, respectively. Finally, a simplified semiconductor wafer fab model is used to verify and validate CMRA. The simulation results demonstrate that CMRA is superior to the original scheduling method to generate a static optimized scheduling plan with better performance on move, step and on-time operational due date rate under uncertain production environments.

APA, Harvard, Vancouver, ISO, and other styles

14

SHIN, JAE KYUN. "EMERGENCE OF STATIC AND DYNAMIC PATTERNS ON TWO-COLOR SLOPE SYSTEM." Fractals 15, no. 03 (September 2007): 237–47. http://dx.doi.org/10.1142/s0218348x07003575.

Full text

Abstract:

Group behavior emergent from the systems composed of two types of agents are investigated. The agents are defined on a two-dimensional grid system and move under the influence of the attractive and/or repulsive interactions. Depending on the intensity and the sense of the interactions, a wide variety of spatiotemporal patterns emerge on the system. Those patterns are discussed in terms of the well-known phenomena in real systems such as the residential segregation in cities, cell sorting in multicellular system, self-running droplet, group behavior of a fish school under the attack of a predator and the fission in a cell division process.

APA, Harvard, Vancouver, ISO, and other styles

15

Khan, Aftab Ahmed, Eraj Humayun Mirza, Badreldin Abdelrhaman Mohamed, Mohamad Ahmed El-Sharawy, Mohammed Hasil Al-Asmari, Abdulaziz Abdullah Al-Khureif, Mushtaq Ahmad Dar, and Pekka K. Vallittu. "Static and dynamic mechanical properties of graphene oxide-based bone cementing agents." Journal of Composite Materials 53, no. 16 (January 24, 2019): 2297–304. http://dx.doi.org/10.1177/0021998319826347.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Deshpande, Paresh, Prathyush P. Menon, and Christopher Edwards. "Delayed static output feedback control of a network of double integrator agents." Automatica 49, no. 11 (November 2013): 3498–501. http://dx.doi.org/10.1016/j.automatica.2013.08.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Desai, Apurva A., and Walter M. Stadler. "Novel kinase inhibitors in renal cell carcinoma: Progressive development of static agents." Current Oncology Reports 7, no. 2 (April 2005): 116–22. http://dx.doi.org/10.1007/s11912-005-0037-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Desai, Apurva A., and Walter M. Stadler. "Novel kinase inhibitors in renal cell carcinoma: Progressive development of static agents." Current Urology Reports 7, no. 1 (February 2006): 16–22. http://dx.doi.org/10.1007/s11934-006-0033-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Kraemer, Landon, and Bikramjit Banerjee. "Informed Initial Policies for Learning in Dec-POMDPs." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 2433–34. http://dx.doi.org/10.1609/aaai.v26i1.8426.

Full text

Abstract:

Decentralized partially observable Markov decision processes (Dec-POMDPs) offer a formal model for planning in cooperative multiagent systems where agents operate with noisy sensors and actuators, and local information. Prevalent Dec-POMDP solution techniques have mostly been centralized and have assumed knowledge of the model. In real world scenarios, however, solving centrally may not be an option and model parameters maybe unknown. To address this, we propose a distributed, model-free algorithm for learning Dec-POMDP policies, in which agents take turns learning, with each agent not currently learning following a static policy. For agents that have not yet learned a policy, this static policy must be initialized. We propose a principled method for learning such initial policies through interaction with the environment. We show that by using such informed initial policies, our alternate learning algorithm can find near-optimal policies for two benchmark problems.

APA, Harvard, Vancouver, ISO, and other styles

20

Martins Araujo Filho, Evandro, and João Viana Da Fonseca Neto. "Multiagent LQR-based Control Design and Gain tuning for Quadcopters Fleet." International Journal for Innovation Education and Research 11, no. 1 (January 1, 2023): 147–64. http://dx.doi.org/10.31686/ijier.vol11.iss1.4066.

Full text

Abstract:

An LQR-based Control design and gain tuning strategies proposals for a multi-agent system are presented in this article, the agents are connected in an undirected graph. Controller gains tuning are adjusted by selecting the Q and R weighting matrices of the Linear Quadratic Regulator. Agreement (consensus) is one of the fundamental problems in multi-agent control, where a set of agents must agree on a joint state value. In the proposed design, first considering that the behavior of the agreement protocol is undirected and static, the main objective is to highlight the complexity of the relationship between the convergence properties of this protocol and the structure of adjacent interconnections. The effects on the formation due to static geometry are analyzed from the resulting data according to the proximity between the agents, where behavior and stability are analyzed based on the desired formation geometry through the construction of the Laplacian matrix.

APA, Harvard, Vancouver, ISO, and other styles

21

Skoulakis, Stratis, Tanner Fiez, Ryann Sim, Georgios Piliouras, and Lillian Ratliff. "Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 13 (May 18, 2021): 11343–51. http://dx.doi.org/10.1609/aaai.v35i13.17352.

Full text

Abstract:

The predominant paradigm in evolutionary game theory and more generally online learning in games is based on a clear distinction between a population of dynamic agents that interact given a fixed, static game. In this paper, we move away from the artificial divide between dynamic agents and static games, to introduce and analyze a large class of competitive settings where both the agents and the games they play evolve strategically over time. We focus on arguably the most archetypal game-theoretic setting---zero-sum games (as well as network generalizations)---and the most studied evolutionary learning dynamic---replicator, the continuous-time analogue of multiplicative weights. Populations of agents compete against each other in a zero-sum competition that itself evolves adversarially to the current population mixture. Remarkably, despite the chaotic coevolution of agents and games, we prove that the system exhibits a number of regularities. First, the system has conservation laws of an information-theoretic flavor that couple the behavior of all agents and games. Secondly, the system is Poincare recurrent, with effectively all possible initializations of agents and games lying on recurrent orbits that come arbitrarily close to their initial conditions infinitely often. Thirdly, the time-average agent behavior and utility converge to the Nash equilibrium values of the time-average game. Finally, we provide a polynomial time algorithm to efficiently predict this time-average behavior for any such coevolving network game.

APA, Harvard, Vancouver, ISO, and other styles

22

Gudisa, Bereda. "Antimycolytic agents: fungistatic and fungicide." Annals of Dermatological Research 6, no. 1 (May 6, 2022): 001–9. http://dx.doi.org/10.29328/journal.adr.1001019.

Full text

Abstract:

Invasive fungal infections are described as a continuous and severe harm to human health and they are associated with at least 1.5 million deaths worldwide each year. Amphotericin B exerts its activity through hydrophobic interactions with cell membrane ergosterol, cause the rupturing or leakage of cell membrane. The antifungal azole medicine group is classified as imidazoles (clotrimazole, ketoconazole, miconazole) and triazoles (fluconazole, itraconazole, voriconazole, posaconazole, isavuconazole) that are named according to the number of nitrogen atoms in the azole ring. Flucytosine is a first-line treatment for the management of cryptococcal meningitis. The most routine adverse effects of fluconazole involve accelerated liver enzymes, gastrointestinal complaints, headache, and skin rash. If antacids, PPIs, H2 blockers administered together with ketoconazole medicines; they will reduce the blood levels of ketoconazole by increasing gastric pH because ketoconazole requires an acidic media for dissolution and systematic absorption. Griseofulvin ruptures mitotic spindle during metaphase by interacting with fungal microtubules-(-), fungal mitosis (metaphase arrest), adequate to block expansion of fungi (drug is static), preventing them from damaging.

APA, Harvard, Vancouver, ISO, and other styles

23

BUSCARINO, ARTURO, AGNESE DI STEFANO, LUIGI FORTUNA, MATTIA FRASCA, and VITO LATORA. "EFFECTS OF MOTION ON EPIDEMIC SPREADING." International Journal of Bifurcation and Chaos 20, no. 03 (March 2010): 765–73. http://dx.doi.org/10.1142/s0218127410026058.

Full text

Abstract:

The study of social networks, and in particular those aspects related to disease spreading, has recently attracted considerable attention in the scientific community. In this paper, we investigate the effect of motion on the spread of diseases in dynamical networks of mobile agents. In order to simulate the long distance displacements empirically observed in real human movements, we consider different motion rules, such as random walks with the addition of jumps or Lévy flights. We compare the epidemic thresholds found in dynamical networks of mobile agents with the analogous expressions for static networks. We discuss the existing relations between dynamical networks of random walkers with jumps and static small-world networks, and those between systems of Lévy walkers and scale-free networks.

APA, Harvard, Vancouver, ISO, and other styles

24

Olsen, Nanna, Elowine Thiran, Tobias Hasler, Thomas Vanzieleghem, Georgios Belibasakis, Jacques Mahillon, Martin Loessner, and Mathias Schmelcher. "Synergistic Removal of Static and Dynamic Staphylococcus aureus Biofilms by Combined Treatment with a Bacteriophage Endolysin and a Polysaccharide Depolymerase." Viruses 10, no. 8 (August 18, 2018): 438. http://dx.doi.org/10.3390/v10080438.

Full text

Abstract:

Staphylococcus aureus is an important pathogen and biofilm former. Biofilms cause problems in clinics and food production and are highly recalcitrant to antibiotics and sanitizers. Bacteriophage endolysins kill bacteria by degrading their cell wall and are therefore deemed promising antimicrobials and anti-biofilm agents. Depolymerases targeting polysaccharides in the extracellular matrix have been suggested as parts of a multi-enzyme approach to eradicate biofilms. The efficacy of endolysins and depolymerases against S. aureus biofilms in static models has been demonstrated. However, there is a lack of studies evaluating their activity against biofilms grown under more realistic conditions. Here, we investigated the efficacy of the endolysin LysK and the poly-N-acetylglucosamine depolymerase DA7 against staphylococcal biofilms in static and dynamic (flow cell-based) models. LysK showed activity against multiple S. aureus strains, and both LysK and DA7 removed static and dynamic biofilms from polystyrene and glass surfaces at low micromolar and nanomolar concentrations, respectively. When combined, the enzymes acted synergistically, as demonstrated by crystal violet staining of static biofilms, significantly reducing viable cell counts compared to individual enzyme treatment in the dynamic model, and confocal laser scanning microscopy. Overall, our results suggest that LysK and DA7 are potent anti-biofilm agents, alone and in combination.

APA, Harvard, Vancouver, ISO, and other styles

25

Surya, Putu Rian Arde, Dewa Made Suria Antara, Ni Gst Nym Suci Murni, and Ni Luh Ayu Kartika Yuniastari Sarja. "The Implementation of E-Commerce Dynamic Rate to Generate Room Revenue." International Journal of Green Tourism Research and Applications 1, no. 1 (December 23, 2019): 34–54. http://dx.doi.org/10.31940/ijogtra.v1i1.1629.

Full text

Abstract:

This study aims to determine the e-commerce dynamic rate structure to generate room revenue and the better implementation between dynamic rate and the static rate at a 3 star hotel in Kuta, Bali. Data collection methods used in this research as follows: interviews, observation, and documentation. The data analysis technique used is the mean analysis technique, dynamic pricing method, profit margin ratio, and descriptive analysis techniques. The results of the study showed the step by step of dynamic rate structure determination and the dynamic rate is better than the static rate. This is indicated by the results of the average profit margin ratio in 2016-2018 on the dynamic rate at 39.41% compared to the static rate at 2.00%. Based on the results of the analysis, any efforts that can be made are paying attention to the dynamic rate during decreasing the Price Points (PP), thus avoiding complaints from offline travel agents and implement the dynamic rates for offline travel agents, hence generate profits with a greater profit margin ratio for the hotel

APA, Harvard, Vancouver, ISO, and other styles

26

Frechette, Casey, and Roxana Moreno. "The Roles of Animated Pedagogical Agents’ Presence and Nonverbal Communication in Multimedia Learning Environments." Journal of Media Psychology 22, no. 2 (January 2010): 61–72. http://dx.doi.org/10.1027/1864-1105/a000009.

Full text

Abstract:

We examined how the presence and nonverbal communication of an animated pedagogical agent affects students’ perceptions and learning. College students learned about astronomy either without an agent’s image or with an agent under one of the following conditions: a static agent (S), an agent with deictic movements (D), an agent with facial expressions (E), or an agent with both deictic movements and facial expressions (DE). Group S outperformed group E on a comprehension test, but no other differences were found on students’ learning or perceptions. The results show that the presence of the studied agent – regardless of nonverbal abilities – did not produce at least a moderate effect size. Further, a static version of the agent was preferable to one with only facial expressions.

APA, Harvard, Vancouver, ISO, and other styles

27

Algazin, Gennady, and Daria Algazina. "Modeling the Dynamics of Collective Behavior in a Reflexive Game with an Arbitrary Number of Leaders." Informatics and Automation 21, no. 2 (February 17, 2022): 339–75. http://dx.doi.org/10.15622/ia.21.2.5.

Full text

Abstract:

An oligopoly with an arbitrary number of Stackelberg leaders under incomplete, asymmetrical agents' awareness and inadequacy of their predictions of competitors' actions is considered. Models of individual decision-making processes by agents are studied. The reflexive games theory and collective behavior theory are the theoretical basis for construction and analytical study process models. They complement each other in that reflexive games allow using the collective behavior procedures and the results of agents' reflections, leading to a Nash equilibrium. The dynamic decision-making process considered repeated static games on a range of agents' feasible responses to the expected actions of the environment, considering current economic restrictions and competitiveness in each game. Each reflexive agent in each game calculates its current goal position and changes its state, taking steps towards the current position of the goal to obtain positive profit or minimize losses. Sufficient conditions for the convergence of processes in discrete time for the case of linear costs of agents and linear demand is the main result of this work. New analytical expressions for the agents' current steps' ranges guarantee the convergence of the collective behavior models to static Nash equilibrium is obtained. That allows each agent to maximize their profit, assuming common knowledge among the agents. The processes when the agent chooses their best response are also analyzed. The latter may not give converging trajectories. The case of the duopoly in comparison with modern results is discussed in detail. Necessary mathematical lemmas, statements, and their proofs are presented.

APA, Harvard, Vancouver, ISO, and other styles

28

Gorbaneva, Olga Ivanovna. "Administrative corruption in the static model of balancing common and private interests." Вопросы безопасности, no. 1 (January 2021): 9–19. http://dx.doi.org/10.25136/2409-7543.2021.1.33466.

Full text

Abstract:

  This article is dedicated to examination of corruption in the previously researched static model of balancing common and private interests (SOCHI-models). In the previously considered two-level system, between the upper non-corrupted level and the lower – agents, is introduced the average level which in exchange for a bribe, can weaken the influence of the upper level. The upper level sets the minimum amount of resources for an agent to spend on general purposes. A supervisor, in exchange for a bribe, the role of which is played by the share of agent’s private income, can reduce this lower boundary, allowing the latter to spend more resources on private purposes. This article reviews the three-level hierarchical system “Principal-Supervisor-Agents”, where the supervisor uses the administrative corruption mechanism, which requires two descriptive and optimization approaches towards its examination. The descriptive approach suggests that the considered functions of bribery are known; while the optimization approach implies the use of Germeyer’s theorem. The author explores the impact of administrative corruption upon systemic congruence of the SOCHI-model: it is proven that the administrative corruption can only reduce congruence. The author finds the conditions that can beat or reduce administrative corruption can, as well as conditions when corruption is disadvantageous for supervisor or agent. The article determines the circle of agents that supervisor can exert influence upon.  

APA, Harvard, Vancouver, ISO, and other styles

29

Gorbaneva, Olga Ivanovna. "Administrative corruption in the static model of balancing common and private interests." Вопросы безопасности, no. 2 (February 2021): 9–19. http://dx.doi.org/10.25136/2409-7543.2021.2.33466.

Full text

Abstract:

  This article is dedicated to examination of corruption in the previously researched static model of balancing common and private interests (SOCHI-models). In the previously considered two-level system, between the upper non-corrupted level and the lower – agents, is introduced the average level which in exchange for a bribe, can weaken the influence of the upper level. The upper level sets the minimum amount of resources for an agent to spend on general purposes. A supervisor, in exchange for a bribe, the role of which is played by the share of agent’s private income, can reduce this lower boundary, allowing the latter to spend more resources on private purposes. This article reviews the three-level hierarchical system “Principal-Supervisor-Agents”, where the supervisor uses the administrative corruption mechanism, which requires two descriptive and optimization approaches towards its examination. The descriptive approach suggests that the considered functions of bribery are known; while the optimization approach implies the use of Germeyer’s theorem. The author explores the impact of administrative corruption upon systemic congruence of the SOCHI-model: it is proven that the administrative corruption can only reduce congruence. The author finds the conditions that can beat or reduce administrative corruption can, as well as conditions when corruption is disadvantageous for supervisor or agent. The article determines the circle of agents that supervisor can exert influence upon.  

APA, Harvard, Vancouver, ISO, and other styles

30

Salman, Hadi, Elif Ayvali, and Howie Choset. "Multi-Agent Ergodic Coverage with Obstacle Avoidance." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 242–49. http://dx.doi.org/10.1609/icaps.v27i1.13816.

Full text

Abstract:

Autonomous exploration and search have important applications in robotics. One interesting application is cooperative control of mobile robotic/sensor networks to achieve uniform coverage of a domain. Ergodic coverage is one solution for this problem in which control laws for the agents are derived so that the agents uniformly cover a target area while maintaining coordination with each other. Prior approaches have assumed the target regions contain no obstacles. In this work, we tackle the problem of static and dynamic obstacle avoidance while maintaining an ergodic coverage goal. We pursue a vector-field-based obstacle avoidance approach and define control laws for idealized kinematic and dynamic systems that avoid static and dynamic obstacles while maintaining ergodicity. We demonstrate this obstacle avoidance methodology via numerical simulation and show how ergodicity is maintained.

APA, Harvard, Vancouver, ISO, and other styles

31

Flôres Jr., Renato G., and Ariane Szafarz. "Agents, Econometricians and the Identification of Rational Expectations Systems." Brazilian Review of Econometrics 14, no. 1 (April 1, 1994): 71–87. http://dx.doi.org/10.12660/bre.v14n11994.2978.

Full text

Abstract:

This paper generalises previous results on the identification of rational expectations (r.e.) models, establishing necessary and sufficient conditions on the structural form of static and dynamic models, without specific assumptions on the stochastic processes generating the endogenous and exogenous variables. The approach allows the econometrician to explore the information in predetermined variables not previsible by the agents. Ways of making operational this knowledge are discussed. As a consequence, the set of identification strategies is broadened and a better insight is gained on the cost/benefit of an early selection on the solutions set.

APA, Harvard, Vancouver, ISO, and other styles

32

Xu, Shuai, Pengyuan Hou, Runran Li, and Fidelis T. Suorineni. "An improved outer pipe method for expansive pressure measurement of static cracking agents." International Journal of Mining Science and Technology 32, no. 1 (January 2022): 27–39. http://dx.doi.org/10.1016/j.ijmst.2021.11.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Chitnis, Parag V., Paul Lee, Jonathan Mamou, John S. Allen, Marcel Böhmer, and Jeffrey A. Ketterling. "Rupture threshold characterization of polymer-shelled ultrasound contrast agents subjected to static overpressure." Journal of Applied Physics 109, no. 8 (April 15, 2011): 084906. http://dx.doi.org/10.1063/1.3565062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Vuille, Cédric, Mark Nidorf, Richard L. Morrissey, John B. Newell, Arthur E. Weyman, and Michael H. Picard. "Effect of Static Pressure on the Disappearance Rate of Specific Echocardiographic Contrast Agents." Journal of the American Society of Echocardiography 7, no. 4 (July 1994): 347–54. http://dx.doi.org/10.1016/s0894-7317(14)80192-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Shafieyan, Yousef, Niloufar Khosravi, Mohammad Moeini, and Thomas M. Quinn. "Diffusion of MRI and CT Contrast Agents in Articular Cartilage under Static Compression." Biophysical Journal 107, no. 2 (July 2014): 485–92. http://dx.doi.org/10.1016/j.bpj.2014.04.041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Fershtman, Daniel, and Alessandro Pavan. "Pandora's Auctions: Dynamic Matching with Unknown Preferences." American Economic Review 107, no. 5 (May 1, 2017): 186–90. http://dx.doi.org/10.1257/aer.p20171043.

Full text

Abstract:

Matching theory typically assumes that agents know their values for possible partners and confines attention to settings in which matching is either static, or driven by population dynamics. In many environments of interest, instead, dynamics originate in the agents learning their preferences through interactions with other agents. In this short paper, we illustrate how platforms can use appropriately designed auctions to account for the joint value of experimentation and cross-subsidization in dynamic matching markets. The model is a stylized version of the general one in Fershtman and Pavan (2016).

APA, Harvard, Vancouver, ISO, and other styles

37

Cai, Ning, Yao Xia Li, and Da Xiang Cui. "Application Studies on Silane Hydrophobic Agents for Concrete Protection." Advanced Materials Research 1053 (October 2014): 297–302. http://dx.doi.org/10.4028/www.scientific.net/amr.1053.297.

Full text

Abstract:

In this paper, the function of silane hydrophobic agents to protect concretes under different varieties and different concentrations were studied. Penetration depth, water absorption ratio and contact angle were measured and compared, the influences of silane hydrophobic agents on the concretes protection under different condition were investigated. Results showed that silane hydrophobic agents exhibit better properties on concretes protection. 24h water absorption ratios of all silane hydrophobic agents surpassed the trade standard JC/T 902-2002 Silicone hydrophobic agent for construction surfaces, and all of the samples showed excellent static water contact angle and hydrophobic property. The protective effect of silane hydrophobic agent B is better than silane hydrophobic agent A.

APA, Harvard, Vancouver, ISO, and other styles

38

ROY, JAIDEEP. "WHEN ASPIRING AND RATIONAL AGENTS STRIVE TO COORDINATE." International Game Theory Review 09, no. 03 (September 2007): 461–75. http://dx.doi.org/10.1142/s0219198907001539.

Full text

Abstract:

The paper studies a game of common interest played infinitely many times between two players, one being aspiration driven while the other being a myopic optimizer. It is shown that the only two long run stationary outcomes are the two static equilibrium points. Robustness of long run behavior is studied to show that whenever the optimizer is allowed to make small mistakes, players are able to coordinate on the Pareto dominant equilibrium point most of the time in the long run if the speed of evolution of aspirations is sufficiently fast. However, when only the aspiring player is allowed to make small mistakes, achieving coordination is inevitable and independent of the speed at which aspirations evolve.

APA, Harvard, Vancouver, ISO, and other styles

39

GRUNDY, JOHN. "VISUAL SPECIFICATION AND MONITORING OF SOFTWARE AGENTS IN DECENTRALIZED PROCESS-CENTRED ENVIRONMENTS." International Journal of Software Engineering and Knowledge Engineering 09, no. 04 (August 1999): 425–44. http://dx.doi.org/10.1142/s0218194099000243.

Full text

Abstract:

Distributed, cooperating software agents are useful in many problem domains, such as task automation and work coordination in process-centered environments. We describe a visual language for specifying such software agents, which uses the composition of event-based software components. These specifications may contain interfaces to remotely executing agents, and agents may be run locally or on distributed machines using a decentralized software architecture. As facilities to configure and monitor the state and activities of such distributed, cooperating software agents is essential, we provide primarily visual capabilities to achieve this. Our static and dynamic software agent visualization techniques have been used on several projects where distributed information processing, system interfacing, work coordination and task automation are required. We illustrate our visualization techniques with examples from these domains.

APA, Harvard, Vancouver, ISO, and other styles

40

Renner, Philipp, and Karl Schmedders. "Discrete‐time dynamic principal–agent models: Contraction mapping theorem and computational treatment." Quantitative Economics 11, no. 4 (2020): 1215–51. http://dx.doi.org/10.3982/qe960.

Full text

Abstract:

We consider discrete‐time dynamic principal–agent problems with continuous choice sets and potentially multiple agents. We prove the existence of a unique solution for the principal's value function only assuming continuity of the functions and compactness of the choice sets. We do this by a contraction mapping theorem and so also obtain a convergence result for the value function iteration. To numerically compute a solution for the problem, we have to solve a collection of static principal–agent problems at each iteration. As a result, in the discrete‐time setting solving the static problem is the difficult step. If the agent's expected utility is a rational function of his action, then we can transform the bi‐level optimization problem into a standard nonlinear program. The final results of our solution method are numerical approximations of the policy and value functions for the dynamic principal–agent model. We illustrate our solution method by solving variations of two prominent social planning models from the economics literature.

APA, Harvard, Vancouver, ISO, and other styles

41

Oksanych, Iryna, and Igor Shevchenko. "MODELS OF A HIERARCHICAL MULTI-AGENT SYSTEM FOR PERFORMING BUSINESS PROCESSES." Transactions of Kremenchuk Mykhailo Ostrohradskyi National University, no. 6(131) (December 26, 2021): 73–78. http://dx.doi.org/10.30929/1995-0519.2021.6.73-78.

Full text

Abstract:

Purpose. Developing a set of models which formally describe the operation environment of the organizational and technical system and the interaction of software agents of different roles in performing business operations. The pres-ence of such a set of models allows you to create information technology for monitoring and routing business processes and reduce costs for business operations. Methodology. The research methods are based on systems analysis methods. Findings. A set of models of hierarchical multi-agent system for business processes has been developed. The complex comprises a static description of the operation environment of the organizational and technical system, where there are models of business process, business operation and its components. Originality. Organization of total monitoring of the operation environment of the organizational and technical system, i.e. the current state of the processes of processing applications, queues and workstations requires the development of static and dynamic business process models. Based on the static description, a model of the dynamics of business processes promoting throughout many workstations has been developed. This makes possible to monitor the status of workstations, queues and applications for business opera-tions. In particular, a formal description of the software agent, its competencies and a model of interaction of three-level agents which perform the functions of business operation executors, monitors and dispatchers has been developed. Having such tools, the second important aspect is the development of a universal hierarchical structure of the multi-agent system, in which different agents perform the roles of performers, monitors and dispatchers. Such a structure should include the regulation of the agent functions, models of agents interaction at all three levels, ways of agents-people communication. Practical value. Tests of the monitoring and scheduling system in different conditions (electronic document management, manufacturing company, human resources management department) showed a decrease in time of business operations, losses on waiting and increase in rhythm of business processes. The results of the work has enabled the development of a queue management strategy, which has showed a reduction in time of operations and a more balanced workload.

APA, Harvard, Vancouver, ISO, and other styles

42

Kušić, Krešimir, Edouard Ivanjko, Filip Vrbanić, Martin Gregurić, and Ivana Dusparic. "Spatial-Temporal Traffic Flow Control on Motorways Using Distributed Multi-Agent Reinforcement Learning." Mathematics 9, no. 23 (November 30, 2021): 3081. http://dx.doi.org/10.3390/math9233081.

Full text

Abstract:

The prevailing variable speed limit (VSL) systems as an effective strategy for traffic control on motorways have the disadvantage that they only work with static VSL zones. Under changing traffic conditions, VSL systems with static VSL zones may perform suboptimally. Therefore, the adaptive design of VSL zones is required in traffic scenarios where congestion characteristics vary widely over space and time. To address this problem, we propose a novel distributed spatial-temporal multi-agent VSL (DWL-ST-VSL) approach capable of dynamically adjusting the length and position of VSL zones to complement the adjustment of speed limits in current VSL control systems. To model DWL-ST-VSL, distributed W-learning (DWL), a reinforcement learning (RL)-based algorithm for collaborative agent-based self-optimization toward multiple policies, is used. Each agent uses RL to learn local policies, thereby maximizing travel speed and eliminating congestion. In addition to local policies, through the concept of remote policies, agents learn how their actions affect their immediate neighbours and which policy or action is preferred in a given situation. To assess the impact of deploying additional agents in the control loop and the different cooperation levels on the control process, DWL-ST-VSL is evaluated in a four-agent configuration (DWL4-ST-VSL). This evaluation is done via SUMO microscopic simulations using collaborative agents controlling four segments upstream of the congestion in traffic scenarios with medium and high traffic loads. DWL also allows for heterogeneity in agents’ policies; cooperating agents in DWL4-ST-VSL implement two speed limit sets with different granularity. DWL4-ST-VSL outperforms all baselines (W-learning-based VSL and simple proportional speed control), which use static VSL zones. Finally, our experiments yield insights into the new concept of VSL control. This may trigger further research on using advanced learning-based technology to design a new generation of adaptive traffic control systems to meet the requirements of operating in a nonstationary environment and at the leading edge of emerging connected and autonomous vehicles in general.

APA, Harvard, Vancouver, ISO, and other styles

43

Ayedi, Dorra, Maïssa Boujelben, and Chokri Rekik. "A Multiagent Architecture for Mobile Robot Navigation Using Hierarchical Fuzzy and Sliding Mode Controllers." Mathematical Problems in Engineering 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/9315925.

Full text

Abstract:

The challenge of this work is to implement an algorithm which enables the robot to achieve independent activities in the purpose of achieving a common goal, which consists in autonomous navigation in a partially unknown environment. The use of multiagent system is convenient for such a problem. Hence, we have designed a structure composed of four agents dedicated to perception, navigation, static, and dynamic obstacle avoidance. Those agents interact through a coordination system.

APA, Harvard, Vancouver, ISO, and other styles

44

Gao, Yanping, Bo Liu, Min Zuo, Tongqiang Jiang, and Junyan Yu. "Consensus of Continuous-Time Multiagent Systems with General Linear Dynamics and Nonuniform Sampling." Mathematical Problems in Engineering 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/718759.

Full text

Abstract:

This paper studies the consensus problem of multiple agents with general linear continuous-time dynamics. It is assumed that the information transmission among agents is intermittent; namely, each agent can only obtain the information of other agents at some discrete times, where the discrete time intervals may not be equal. Some sufficient conditions for consensus in the cases of state feedback and static output feedback are established, and it is shown that if the controller gain and the upper bound of discrete time intervals satisfy certain linear matrix inequality, then consensus can be reached. Simulations are performed to validate the theoretical results.

APA, Harvard, Vancouver, ISO, and other styles

45

SEN, SANDIP, and EDMUND H. DURFEE. "THE ROLE OF COMMITMENT IN COOPERATIVE NEGOTIATION." International Journal of Cooperative Information Systems 03, no. 01 (March 1994): 67–81. http://dx.doi.org/10.1142/s0218215794000053.

Full text

Abstract:

Cooperative information agents need mechanisms that enable them to work together effectively while solving common problems. We investigate the use of commitment by agents to proposed actions as a mechanism that allow agents to work concurrently on interdependent problems. Judicious use of commitment can not only increase the throughput of cooperative information systems, but also allow them to deal flexibly with dynamically changing environments. We use the domain of distributed scheduling to demonstrate that static commitment strategies are ineffective. Results from simulated experiments are used to identify the environmental features on which an adaptive commitment strategy should be predicated.

APA, Harvard, Vancouver, ISO, and other styles

46

Wu, Ping Ping, Cheng Zhang, Hai Fang Xu, De Xin Huang, Bing Xu, and Dan Yu Jiang. "Corrosion Behaviors of Borosilicate Glasses in Various Leaching Agents." Advanced Materials Research 177 (December 2010): 466–69. http://dx.doi.org/10.4028/www.scientific.net/amr.177.466.

Full text

Abstract:

Static short-term corrosion tests were performed to two kinds of borosilicate glasses in deionized water, at 70°C and 150°C, respectively. Same corrosion experiments were also carried out in other leaching agents, such as simulated under ground water of Beishan, sulfuric acid solution (pH=0.5) and potassium hydroxide solution (pH = 13). Experimental results show that both leaching agent and corrosion temperature co-dominate the corrosion process, and the temperature plays more important role. At low temperature of 70°C, the corrosion reaction is controlled by the ion diffusing in DIW at earlier stage. While in PHS, network hydrolysis reaction is the main corrosion mechanism.

APA, Harvard, Vancouver, ISO, and other styles

47

Wagner, Glenn, and Howie Choset. "Path Planning for Multiple Agents under Uncertainty." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 577–85. http://dx.doi.org/10.1609/icaps.v27i1.13866.

Full text

Abstract:

Multi-agent systems in cluttered environments require path planning that not only prevents collisions with static obstacles, but also safely coordinates the motion of many agents. The challenge of multi-agent path finding becomes even more difficult when the agents experience uncertainty in their pose. In this work, we develop a multi-agent path planner that considers uncertainty, called uncertainty M* (UM*), which is based on a prior multi-agent path approach called M*. UM* plans a path through the belief space for each individual agent and then uses a strategy similar to M* that coordinates only agents that are “likely” to collide. This approach has the same scalability advantages as M*. We then introduce an extension called Permuted UM* (PUM*) that uses randomized restarts to enhance performance. We finish by presenting a belief space representation appropriate for multi-agent path planning with uncertainty and validate the performance of UM* and PUM* in simulation and mixed-reality experiments.

APA, Harvard, Vancouver, ISO, and other styles

48

Villacorta, Pablo J., and David A. Pelta. "A repeated imitation model with dependence between stages: Decision strategies and rewards." International Journal of Applied Mathematics and Computer Science 25, no. 3 (September 1, 2015): 617–30. http://dx.doi.org/10.1515/amcs-2015-0045.

Full text

Abstract:

Abstract Adversarial decision making is aimed at determining strategies to anticipate the behavior of an opponent trying to learn from our actions. One defense is to make decisions intended to confuse the opponent, although our rewards can be diminished. This idea has already been captured in an adversarial model introduced in a previous work, in which two agents separately issue responses to an unknown sequence of external inputs. Each agent’s reward depends on the current input and the responses of both agents. In this contribution, (a) we extend the original model by establishing stochastic dependence between an agent’s responses and the next input of the sequence, and (b) we study the design of time varying decision strategies for the extended model. The strategies obtained are compared against static strategies from theoretical and empirical points of view. The results show that time varying strategies outperform static ones

APA, Harvard, Vancouver, ISO, and other styles

49

Morris, Cassandra E., and Thomas C. Skalak. "Acute exposure to a moderate strength static magnetic field reduces edema formation in rats." American Journal of Physiology-Heart and Circulatory Physiology 294, no. 1 (January 2008): H50—H57. http://dx.doi.org/10.1152/ajpheart.00529.2007.

Full text

Abstract:

External application of static magnetic fields (SMF), used specifically for the treatment of inflammatory conditions such as soft tissue injuries, has recently become popular as a complementary and/or alternative therapy with minimal investigation into efficacy or mechanism. Localized inflammation was induced via injection of inflammatory agents λ-carrageenan (CA) or histamine into rat hindpaws, alone or in conjunction with pharmacological agents, resulting in a spatially and temporally defined inflammatory reaction. Application of a 10- or 70-mT, but not a 400-mT, SMF for 15 or 30 min immediately following histamine-induced edema resulted in a significant, 20–50% reduction in edema formation. In addition, a 2-h, 70-mT field application to CA-induced edema also resulted in significant (33–37%) edema reduction. Field application before injection or at the time of maximal edema did not influence edema formation or resolution, respectively. Together, these results suggest the existence of a therapeutic threshold of SMF strength (below 400 mT) and a temporal dependence of efficacy. Administration of pharmacological agents directed at nitric oxide signaling and L-type Ca2+ channel dynamics in conjunction with SMF treatment and histamine-induced edema revealed that the potential mechanism of SMF action may be via modulation of vascular tone through effects on L-type Ca2+ channels in vascular smooth muscle cells.

APA, Harvard, Vancouver, ISO, and other styles

50

Li, Kehong, Wenke Wang, Yadong Zhang, Tao Zheng, and Jin Guo. "Game Modelling and Strategy Research on the System Dynamics–based Quadruplicate Evolution for High–speed Railway Operational Safety Supervision System." Sustainability 11, no. 5 (March 1, 2019): 1300. http://dx.doi.org/10.3390/su11051300.

Full text

Abstract:

In view of the entrusted transportation management model (ETMM) of China’s high–speed railway (HSR), the supervision strategy of an HSR company for its multiple agents plays a very important role in ensuring the safety and sustainable development of HSR. Due to the existence of multiple agents in ETMM, the supervision strategy for these agents is usually difficult to formulate. In this study, a quadruplicate HSR safety supervision system evolutionary game model composed of an HSR company and three agents was established through the analysis of the complex game relationship existing in the system. The behavioral characteristics and the steady state of decision–making of all stakeholders involved in the system are proved by evolutionary game theory and system dynamics simulation. The results show that there will be long–term fluctuations in the strategies selected by the four stakeholders in the static reward–penalty control scenario (RPCS), which indicates that an evolutionary stable strategy does not exist. With increases in the reward–penalty coefficient, the fluctuations are intensified. Therefore, the dynamic RPCS was proposed to control the fluctuations, and the simulation was repeated. The results show that the fluctuations can be effectively restrained by adopting the dynamic RPCS, but if the coefficients are the same, the static RPCS is better than the dynamic RPCS for increasing the safety investment rate of the three agents. This demonstrates that the HSR company should apply these two control scenarios flexibly according to the actual situation when formulating a supervision strategy in order to effectively control and enhance the safety level of HSR operations when multiple agents are involved.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Static Agents'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles