Related papers: Optimization in a non-linear Lanchester-type model…
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…
Stochastic patrol routing is known to be advantageous in adversarial settings; however, the optimal choice of stochastic routing strategy is dependent on a model of the adversary. We adopt a worst-case omniscient adversary model from the…
Because an agents resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such as power or payload restrictions), the competing needs of other…
To account for volatile renewable energy supply, energy systems optimization problems require high temporal resolution. Many models use time-series clustering to find representative periods to reduce the amount of time-series input data and…
When allocating indivisible items to agents, it is known that the only strategyproof mechanisms that satisfy a set of rather mild conditions are constrained serial dictatorships: given a fixed order over agents, at each step the designated…
This tutorial contrasts probabilistic modeling and robust optimization to determine decisions in humanitarian logistics, specifically supply chains subject to adversarial (natural and human) disruptions. Natural disruptions induce dispatch…
We study the allocation strategies for redundant components in the load-sharing series/parallel systems. We show that under the specified assumptions, the allocation of a redundant component to the stochastically weakest (strongest)…
This paper is dealing with another multiple person game model under the antagonistic duel type setup. The most flexible multiple person duel game is analytically solved and the explicit formulas are solved to determine the time dependent…
In this monograph, we introduce a new model in population dynamics that describes two species sharing the same environmental resources in a situation of open hostility. The interactions among these populations are described not in terms of…
In the United States, medical responses by fire departments over the last four decades increased by 367%. This had made it critical to decision makers in emergency response departments that existing resources are efficiently used. In this…
We study a sequential resource allocation problem between a fixed number of arms. On each iteration the algorithm distributes a resource among the arms in order to maximize the expected success rate. Allocating more of the resource to a…
Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken…
We study exploration in stochastic multi-armed bandits when we have access to a divisible resource that can be allocated in varying amounts to arm pulls. We focus in particular on the allocation of distributed computing resources, where we…
This paper models the US-China trade conflict and attempts to analyze the (optimal) strategic choices. In contrast to the existing literature on the topic, we employ the expected utility theory and examine the conflict mathematically. In…
Motivated by the design question of additional fuel needed to complete a task in an uncertain environment, this paper introduces metrics to quantify the maximal additional energy used by a control system in the presence of bounded…
Motivated by recommendation problems in music streaming platforms, we propose a nonstationary stochastic bandit model in which the expected reward of an arm depends on the number of rounds that have passed since the arm was last pulled.…
This letter proposes an energy efficient distributed worst case robust power allocation in massive multiple input multiple output (MIMO) system. We assume a bounded channel state information (CSI) error and all channels lie in some bounded…
This paper presents two complementary frameworks to optimize Formula 1 race strategies, jointly accounting for energy allocation, tire wear and pit stop timing. First, the race scenario is modeled using lap time maps and a dynamic tire wear…
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied…
Many applications of computational fluid dynamics require multiple simulations of a flow under different input conditions. In this paper, a numerical algorithm is developed to efficiently determine a set of such simulations in which the…