scholarly journals Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents

2021 ◽  
Author(s):  
Zhigang Cao ◽  
Bo Chen ◽  
Xujin Chen ◽  
Changjun Wang
Keyword(s):  
Subgame Perfect Equilibrium ◽  
Selfish Routing ◽  
Dynamic Flow ◽  
Pure Nash Equilibrium ◽  
Adaptive Agents ◽  
Atomic Dynamic ◽  
Edge Based ◽  
The One ◽  
First In First Out ◽  
Best Responses

We propose a game model for selfish routing of atomic agents, who compete for use of a network to travel from their origins to a common destination as quickly as possible. We follow a frequently used rule that the latency an agent experiences on each edge is a constant transit time plus a variable waiting time in a queue. A key feature that differentiates our model from related ones is an edge-based tie-breaking rule for prioritizing agents in queueing when they reach an edge at the same time. We study both nonadaptive agents (each choosing a one-off origin–destination path simultaneously at the very beginning) and adaptive ones (each making an online decision at every nonterminal vertex they reach as to which next edge to take). On the one hand, we constructively prove that a (pure) Nash equilibrium (NE) always exists for nonadaptive agents and show that every NE is weakly Pareto optimal and globally first-in first-out. We present efficient algorithms for finding an NE and best responses of nonadaptive agents. On the other hand, we are among the first to consider adaptive atomic agents, for which we show that a subgame perfect equilibrium (SPE) always exists and that each NE outcome for nonadaptive agents is an SPE outcome for adaptive agents but not vice versa.

Grocery shelf stocking tool: analysis of productivity and human factors

2016 ◽  
Vol 65 (4) ◽  
pp. 554-570 ◽  
Author(s):  
Corey J Blackwell ◽  
Julia Sarah Wasas ◽  
Sean Patrick Flanagan ◽  
Bryan A Norman ◽  
Joel Michael Haight
Keyword(s):  
Sagittal Plane ◽  
Grocery Store ◽  
Grocery Stores ◽  
Cumulative Trauma ◽  
Efficient Manner ◽  
Content Type ◽  
Disc Position ◽  
Store Environment ◽  
The One ◽  
First In First Out

Purpose – Grocery store tasks provide many opportunities for efficiency and ergonomic improvements. Shelf stocking is one task that has received considerable attention in recent years as grocery stores seek to remain competitive by stocking shelves in an efficient manner in order to satisfy customers. The purpose of this paper is to detail an analysis performed to evaluate the effectiveness of a grocery store shelf stocking tool. This shelf stocking aid is a device designed to improve the accuracy and efficiency of stocking and fronting shelves in a supermarket or a similar retail environment. Design/methodology/approach – To test the claims that the device actually does improve stocking accuracy, efficiency, and ergonomic soundness, an experiment was conducted to compare the processes of stocking shelves and fronting items on shelves with and without the stocking tool. In creating the realistic conditions of a real-world store environment, extensive inquiry about item stocking and fronting procedures was made by visiting stores and discussing the stocking and fronting tasks with industry experts. Tests were performed at varying combinations of shelf heights, shelf fullness, with and without First-In First-Out processing, and with various merchandise sizes and shapes. Findings – The results indicate that the shelf stocking tool significantly reduces shelf stocking and fronting time. The ergonomic merits of the tool were also analyzed. A Rapid Upper Limb Assessment (RULA) was performed to evaluate biomechanical and postural stresses experienced by a shelf stocker as they stock and front store shelves. It appears that the largest contributor to higher-than-expected RULA scores is extensive upper torso bending in the sagittal plane at the L5 S1 disc position. This is exacerbated as the stocker reaches lower shelves and bends forward to reach under the shelf directly above the item being stocked or fronted. Research limitations/implications – Only three tall and five short items were used in testing. More testing is needed to draw conclusions about stacking items. Cumulative fatigue effects were not tested nor were the locations of specific physical discomfort. Testing was not done to examine simultaneously fronting two rows with the shelf stocking tool. Testing was not done to simulate the use of a step stool, including moving and repositioning the step stool for manual restocking and fronting on high shelves. The step stool handling would improve relative performance of the shelf stocking tool because the tool eliminates the need for a step stool. Practical implications – Grocery store shelf stocking associates are at risk of developing cumulative trauma type injuries from awkward posture that they have to use when stocking shelves. With many small items on a shelf that are continually becoming disheveled as customers purchase the items, there are significant inefficiencies in continually arranging and rearranging the items as well as adding new. The analysis of a tool of the type tested here has shown that the use of a simple tool such as the one tested can go a long way to improving both of these elements of the stocking and fronting task. Originality/value – While the shelf stocking tool is not necessarily a remedy for bending, it appears to reduce more pronounced bending than what is required without it. For stocking or fronting upper shelves, it also appears to reduce the extensive reaches (the second most stressful contributor to the high RULA scores). This approach to stocking and fronting shelves has helped to verify the idea that a tool such as this can help to improve not only the speed and efficiency at which the task is accomplished it can also reduce the stress on the back and shoulders during this tedious task.

scholarly journals The one player guessing game: a diagnosis on the relationship between equilibrium play, beliefs, and best responses

2020 ◽  
Vol 23 (4) ◽  
pp. 1129-1147 ◽  
Author(s):  
Ciril Bosch-Rosa ◽  
Thomas Meissner
Keyword(s):  
Two Dimensions ◽  
The Other ◽  
Belief Formation ◽  
Game Form ◽  
Strategic Game ◽  
Individual Decision ◽  
Individual Decision Making ◽  
The One ◽  
The Relationship ◽  
Best Responses

Abstract Experiments involving games have two dimensions of difficulty for subjects in the laboratory. One is understanding the rules and structure of the game and the other is forming beliefs about the behavior of other players. Typically, these two dimensions cannot be disentangled as belief formation crucially depends on the understanding of the game. We present the one-player guessing game, a variation of the two-player guessing game (Grosskopf and Nagel 2008), which turns an otherwise strategic game into an individual decision-making task. The results show that a majority of subjects fail to understand the structure of the game. Moreover, subjects with a better understanding of the structure of the game form more accurate beliefs of other player’s choices, and also better-respond to these beliefs.

scholarly journals Edge-Based Missing Data Imputation in Large-Scale Environments

Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 195
Author(s):  
Davide Andrea Guastella ◽  
Guilhem Marcillaud ◽  
Cesare Valenti
Keyword(s):  
Urban Environment ◽  
Large Scale ◽  
Smart Cities ◽  
Low Cost ◽  
Real Data ◽  
Missing Data Imputation ◽  
Large Scale Data ◽  
Iot Devices ◽  
Edge Based ◽  
The One

Smart cities leverage large amounts of data acquired in the urban environment in the context of decision support tools. These tools enable monitoring the environment to improve the quality of services offered to citizens. The increasing diffusion of personal Internet of things devices capable of sensing the physical environment allows for low-cost solutions to acquire a large amount of information within the urban environment. On the one hand, the use of mobile and intermittent sensors implies new scenarios of large-scale data analysis; on the other hand, it involves different challenges such as intermittent sensors and integrity of acquired data. To this effect, edge computing emerges as a methodology to distribute computation among different IoT devices to analyze data locally. We present here a new methodology for imputing environmental information during the acquisition step, due to missing or otherwise out of order sensors, by distributing the computation among a variety of fixed and mobile devices. Numerous experiments have been carried out on real data to confirm the validity of the proposed method.

scholarly journals ANALYSIS OF COMMUTER LINE TICKET PURCHASE QUEUING SYSTEM IN BOGOR STATION

2017 ◽  
Vol 2 (02) ◽  
pp. 35
Author(s):  
Resista Vikaliana
Keyword(s):  
Queuing Theory ◽  
Service Use ◽  
Single Channel ◽  
Performance Measure ◽  
Queuing System ◽  
Queuing Model ◽  
The One ◽  
Multi Phase ◽  
Ticket Purchase ◽  
First In First Out

Queue is a situation that happen to people, goods, and components that need to wait to get a service. The good quality of service will satisfy the customers and decrease the queue line. Queue often happens in a station especially in weekdays. A long queue line happens in the station is one of the problems that need to be solved. Instead of manual ticket purchasing that served by the operator, today PT KAI Commuter Line also serve ticket purchasing using THB machine. The purpose of this study is to compare the performance of queuing model that happen in Bogor station locket and to determine if the queuing model is efficient by comparing the service standard, between the manual and the one that used THB machine. The method used in this research was descriptive method by using queuing theory calculation. The model of locket queuing using THB machine in Bogor Station is Multi Channel-Multi Phase, in ticket purchasing using THB machine. Besides, in the operator locket service, the queuing model is Single Channel-Single Phase. Both s ticket purchasing service use First In First Out (FIFO) disciple. The maximum amount of the queue line and the source of customers’ arrival are infinite. Based on the value of system performance can be concluded that queuing system and the service given already great and effective (based on the performance measure and probability or passengers’’ chances), passengers who are waiting to buy tickets, either manual or using machine less than 1, or assumed 1 person. From the observation, the use of THB machine decrease the queue line, but need to be socialized because passengers does not know how to use THB machine to buy ticket independently.Keywords: queue, queuing model, commuter line ticket purchasing, Bogor station

scholarly journals A Novel Heuristic to Minimize the Bottlenecks Presence in Batch Generation. Case of Study.

2021 ◽  
Author(s):  
Pedro Henoc Ireta-Sánchez ◽  
Elías Gabriel Carrum-Siller ◽  
David Salvador González-González ◽  
Ricardo Martínez-López
Keyword(s):  
Simulated Annealing ◽  
Processing Time ◽  
Heuristic Method ◽  
The Other ◽  
Dispatching Rule ◽  
Processing Times ◽  
Real Process ◽  
Random Instances ◽  
The One ◽  
First In First Out

Abstract This paper presents a new heuristic method capable of minimizing the presence of bottlenecks generated when production batches have a distinct makespan. The proposed heuristic groups the jobs into items, where the one with the longest processing time in the batch determines the makespan. To test the heuristic, information was collected from a real paint process with two stations: one with a single cabin and the other with two parallel cabins. The capacity of processing jobs is limited by the cabin dimensions where jobs have different sizes and processing times. A makespan comparison between the heuristic proposed versus the First in First out (FIFO) dispatching rule that the case of study uses. Additionally, ten random instances based on data taken from the real process were created with the purpose to compare the new heuristic method versus Genetic Algorithm (GA) and Simulated Annealing (SA). The result of the comparison to FIFO, GA and SA showed that the proposed heuristic minimizes the bottleneck in a and creating batches almost with the same makespan. Results indicated a bottleneck time reduction of 96% when new heuristic method were compared to FIFO rule, while compared to Generic Algorithm and Simulated Annealing the bottleneck reduction were around 89% in both cases.

Politics at the Water's Edge: Parties, Voters, and the Use of Force Abroad

1998 ◽  
Vol 52 (2) ◽  
pp. 307-324 ◽  
Author(s):  
Joanne Gowa
Keyword(s):  
Political Parties ◽  
Use Of Force ◽  
Subgame Perfect Equilibrium ◽  
Repeated Game ◽  
Partisan Politics ◽  
Theoretic Model ◽  
Equilibrium Outcome ◽  
Game Theoretic ◽  
Game Theoretic Model ◽  
The One

This article examines the effects of party politics and presidential election cycles on U.S. recourse to force abroad. I analyze a game-theoretic model to generate predictions about these effects. In the unique time-consistent equilibrium outcome of the one-shot game, policy varies across political parties. In a subgame–perfect equilibrium outcome of the repeated game, the use of force is invariant to the partisan composition of government. In neither case does policy respond to the electoral cycle.An empirical analysis supports the predictions of the repeated game. Between 1870 and 1992, U.S. recourse to force abroad responds neither to partisan politics nor to the domestic political calendar. It responds only to changes in U.S. power status and to the advent of general wars.

REFINEMENTS OF NASH EQUILIBRIA IN VIEW OF JEALOUS OR FRIENDLY BEHAVIOR OF PLAYERS

2002 ◽  
Vol 04 (03) ◽  
pp. 281-299 ◽  
Author(s):  
AGNIESZKA RUSINOWSKA
Keyword(s):  
Nash Equilibria ◽  
Subgame Perfect Equilibrium ◽  
Perfect Equilibrium ◽  
Infinitely Divisible ◽  
Common Assumption ◽  
Bargaining Models ◽  
The Common ◽  
Simultaneous Moves ◽  
The One ◽  
Alternating Offers

In this paper, several bargaining models, differing in some assumptions from each other, are analyzed. We consider a discrete case and a continuous case. In the former model, players bargain over a division of n objects. In the latter, parties divide one unit of infinitely divisible good. We start with an analysis of the one-round model, and then we consider a model in which players can continue to bargain. For each model, simultaneous moves as well as alternating offers of players are considered. The assumption that each player receives no more than his/her opponent proposes giving to him/her is the common assumption for all cases analyzed. Moreover, we adopt some assumptions concerning players' attitudes towards their opponents' payments, assuming that players can be either jealous or friendly. In view of the jealousy or friendliness of players, Nash equilibrium and subgame perfect equilibrium are described.

scholarly journals Comparison between evapotranspiration estimation models for Macapá, Amapá

2020 ◽  
Vol 13 (12) ◽  
pp. 15
Author(s):  
G. S. Picanço ◽  
O. S. Nascimento ◽  
W. C. M. Silva ◽  
O. B. Q. Oliveira Filho
Keyword(s):  
Statistical Tests ◽  
Absolute Error ◽  
The Other ◽  
Coefficient Of Determination ◽  
Mass Coefficient ◽  
Evapotranspiration Estimation ◽  
The One ◽  
Best Responses ◽  
Small Dispersion ◽  
Estimation Models

The aim of the study was to evaluate evapotranspiration (ET) estimation models for the municipality of Macapá, AP. The models studied were Hargreaves-Samani (HS), Turc, Camargo (CM), Jensen-Haise (JH) and Solar Radiation (RS). The ET estimated by the models were compared with those obtained by the standard Penman-Monteith method. Statistical tests of Willmot's Concordance index (d), Correlation Coefficient (r), Performance coefficient (c), Mean Absolute Error (EAM), Mean Square Error and Residual Mass Coefficient (CMR) were performed. With the results of "c" only HS, in August (c = 0.71; "good") and December (c = 0.73; "good") presented a performance considered good. JH had the worst result, between 0.05 and 0.22, considered terrible. In relation to “d”, HS also had a better result, with 0.79 and 0.83 in August and December. The worst was JH, with a minimum value of 0.09 for May. For CMR, CM, JH and RS overestimated ET. TC, on the other hand, presented both underestimation and overestimation. HS overestimated from January to July and underestimated in the other months. For EAM, the models tended to overestimate ET. For MSE, HS presented the lowest values. JH was the one with the worst results, above 4. And the coefficient of determination showed a small dispersion of data, with R2 above 0.90 for HS, TC, JH and RS. Based on what was exposed, HS was the method that presented the best responses, followed by CT and RS. And JH was the one with the highest overestimation rate.

scholarly journals On the transient waiting times for a GI/M/1 priority queue

1980 ◽  
Vol 17 (01) ◽  
pp. 227-234
Author(s):  
G. Dalen ◽  
B. Natvig
Keyword(s):  
Special Interest ◽  
Waiting Times ◽  
Priority Queue ◽  
Queueing Model ◽  
Waiting Room ◽  
Priority Class ◽  
The One ◽  
First In First Out

In this paper we consider the GI/M/1 queueing model with infinite waiting-room capacity. The customer arriving at t = 0 will find k — 1 customers waiting. The latter customers belong to a second priority class, whereas the ones arriving in [0,∞) belong to a first priority class and have the higher priority. Within each class we have a first-in-first-out queueing discipline. A customer, once at the service-point, remains there until his service is completed. Then the next customer for service is the one of highest priority among those queueing. For this model we derive the transient waiting times for customers belonging to both priority classes. The results are of special interest in appointment systems where customers may not turn up.

scholarly journals On the transient waiting times for a GI/M/1 priority queue

1980 ◽  
Vol 17 (1) ◽  
pp. 227-234 ◽  
Author(s):  
G. Dalen ◽  
B. Natvig
Keyword(s):  
Special Interest ◽  
Waiting Times ◽  
Priority Queue ◽  
Queueing Model ◽  
Waiting Room ◽  
Priority Class ◽  
The One ◽  
First In First Out

In this paper we consider the GI/M/1 queueing model with infinite waiting-room capacity. The customer arriving at t = 0 will find k — 1 customers waiting. The latter customers belong to a second priority class, whereas the ones arriving in [0,∞) belong to a first priority class and have the higher priority. Within each class we have a first-in-first-out queueing discipline. A customer, once at the service-point, remains there until his service is completed. Then the next customer for service is the one of highest priority among those queueing.For this model we derive the transient waiting times for customers belonging to both priority classes. The results are of special interest in appointment systems where customers may not turn up.

Sign in / Sign up

Export Citation Format

Share Document