Related papers: The Price of Anarchy for Instantaneous Dynamic Equ…
This work is motivated by our collaboration with a large consumer packaged goods (CPG) company. We have found that while the company appreciates the advantages of dynamic pricing, they deem it operationally much easier to plan out a static…
The deployment of machine learning in high-stakes services relies on ``human-in-the-loop'' architectures to mitigate algorithmic uncertainty. However, existing static policies fail to address a fundamental tension: algorithms suffer from…
The recent drastic increase in mobile data traffic has pushed the mobile edge computing systems to the limit of their capacity. A promising solution to this problem is the task migration provided by unmanned aerial vehicles (UAV). Key…
We study coordination mechanisms for Scheduling Games (with unrelated machines). In these games, each job represents a player, who needs to choose a machine for its execution, and intends to complete earliest possible. Our goal is to design…
ODE solvers with randomly sampled timestep sizes appear in the context of chaotic dynamical systems, differential equations with low regularity, and, implicitly, in stochastic optimisation. In this work, we propose and study the stochastic…
Randomized load-balancing algorithms play an important role in improving performance in large-scale networks at relatively low computational cost. A common model of such a system is a network of $N$ parallel queues in which incoming jobs…
Wardrop equilibria in nonatomic congestion games are in general inefficient as they do not induce an optimal flow that minimizes the total travel time. Network tolls are a prominent and popular way to induce an optimum flow in equilibrium.…
This paper studies the stability and dynamic control of underlay mobile edge networks. First, the stability region for a multiuser edge network is obtained under the assumption of full channel state information. This result provides a…
Varied real world systems such as transportation networks, supply chains and energy grids present coordination problems where many agents must learn to share resources. It is well known that the independent and selfish interactions of…
A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…
The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propose a framework for designing distributed algorithms with a…
This paper investigates design of noncooperative games from an optimization and control theoretic perspective. Pricing mechanisms are used as a design tool to ensure that the Nash equilibrium of a fairly general class of noncooperative…
We develop an empirical behavioural order-driven (EBOD) model, which consists of an order placement process and an order cancellation process. Price limit rules are introduced in the definition of relative price. The order placement process…
In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…
We study an optimal stopping problem under non-exponential discounting, where the state process is a multi-dimensional continuous strong Markov process. The discount function is taken to be log sub-additive, capturing decreasing impatience…
This paper proposes a bilevel transit network design problem considering supply side uncertainty. The upper level problem determines frequency settings to simultaneously maximize the efficiency and equity measures, which are defined by the…
We study a dynamic traffic assignment model, where agents base their instantaneous routing decisions on real-time delay predictions. We formulate a mathematically concise model and define dynamic prediction equilibrium (DPE) in which no…
We consider three equilibrium concepts proposed in the literature for time-inconsistent stopping problems, including mild equilibria, weak equilibria and strong equilibria. The discount function is assumed to be log sub-additive and the…
This paper analyzes a service system modeled as a single-server queue, in which the service provider aims to dynamically maximize the expected revenue per unit of time. This is achieved by constructing a stochastic gradient descent…
This study focuses on order dispatch decisions within two-echelon supply chains, where order dispatch creates economic shipments to reduce delivery costs. Dispatching orders is often constrained by delivery windows, leading to penalty costs…