English
Related papers

Related papers: Stability-Preserving, Time-Efficient Mechanisms fo…

200 papers

This paper studies the problem of selecting a minimum-size set of input nodes to guarantee stability of a networked system in the presence of uncertainties and time delays. Current approaches to input selection in networked dynamical…

Optimization and Control · Mathematics 2017-12-13 Zhipeng Liu , Yao Long , Andrew Clark , Phillip Lee , Linda Bushnell , Daniel Kirschen , Radha Poovendran

We consider the allocation of $m$ balls (jobs) into $n$ bins (servers). In the standard Two-Choice process, at each step $t=1,2,\ldots,m$ we first sample two randomly chosen bins, compare their two loads and then place a ball in the least…

Discrete Mathematics · Computer Science 2023-12-27 Dimitrios Los , Thomas Sauerwald

A hallmark of intelligence is the ability to adapt in non-stationary environments, yet deep Reinforcement Learning (RL) agents often struggle in such settings. Prior studies introduce non-stationarity through abrupt shifts in features or…

Machine Learning · Computer Science 2026-05-28 Raymond Chua , Doina Precup , Blake Richards

There are many natural, physical, and biological systems that exhibit multiple time scales. For example, the dynamics of a population of ticks can be described in continuous time during their individual life cycle yet discrete time is used…

Dynamical Systems · Mathematics 2009-07-10 Raquel M. Lopez , Sergei K. Suslov , Erika T. Camacho

We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are…

Data Structures and Algorithms · Computer Science 2024-07-16 Evripidis Bampis , Konstantinos Dogeas , Thomas Erlebach , Nicole Megow , Jens Schlöter , Amitabh Trehan

The theory of two-sided matching has been extensively developed and applied to many real-life application domains. As the theory has been applied to increasingly diverse types of environments, researchers and practitioners have encountered…

Computer Science and Game Theory · Computer Science 2024-02-05 Sung-Ho Cho , Kei Kimura , Kiki Liu , Kwei-guu Liu , Zhengjie Liu , Zhaohong Sun , Kentaro Yahiro , Makoto Yokoo

We consider a stylized formal model of public transportation, where a set of agents need to travel along a given road, and there is a bus that runs the length of this road. Each agent has a left terminal and a right terminal between which…

Computer Science and Game Theory · Computer Science 2025-09-24 Martin Bullinger , Edith Elkind , Mohamad Latifian

We define and study a new variant of the secretary problem. Whereas in the classic setting multiple secretaries compete for a single position, we study the case where the secretaries arrive one at a time and are assigned, in an on-line…

Computer Science and Game Theory · Computer Science 2017-05-05 Yakov Babichenko , Yuval Emek , Michal Feldman , Boaz Patt-Shamir , Ron Peretz , Rann Smorodinsky

In many applications such as rationing medical care and supplies, university admissions, and the assignment of public housing, the decision of who receives an allocation can be justified by various normative criteria. Such settings have…

Computer Science and Game Theory · Computer Science 2023-05-30 Siddhartha Banerjee , Matthew Eichhorn , David Kempe

We consider a multi-stage facility reallocation problems on the real line, where a facility is being moved between time stages based on the locations reported by $n$ agents. The aim of the reallocation algorithm is to minimise the social…

Computer Science and Game Theory · Computer Science 2021-03-25 Bart de Keijzer , Dominik Wojtczak

Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal graph which asks for a sequence of solutions to the…

Data Structures and Algorithms · Computer Science 2025-09-22 Tom Davot , Jessica Enright , Laura Larios-Jones

Reinforcement learning (RL) faces substantial challenges when applied to real-life problems, primarily stemming from the scarcity of available data due to limited interactions with the environment. This limitation is exacerbated by the fact…

Neural and Evolutionary Computing · Computer Science 2024-04-10 Cristiano Capone , Paolo Muratore

How do decisions change with the economic environment and with time? This paper studies general nonstationary stopping problems and provides the methodological tools to answer these questions. First, we identify conditions that ensure a…

Theoretical Economics · Economics 2024-08-01 Théo Durandard , Matteo Camboni

Two-stage optimization with recourse model is an important and widely used model, which has been studied extensively these years. In this article, we will look at a new variant of it, called the two-stage optimization with recourse and…

Data Structures and Algorithms · Computer Science 2016-10-24 Haotian Jiang

We study the problem of finding "fair" stable matchings in the Stable Marriage problem with Incomplete lists (SMI). For an instance $I$ of SMI there may be many stable matchings, providing significantly different outcomes for the sets of…

Data Structures and Algorithms · Computer Science 2020-04-17 Frances Cooper , David Manlove

We establish stability criterion for a two-class retrial system with Poisson inputs, general class-dependent service times and class-dependent constant retrial rates. We also characterise an interesting phenomenon of partial stability when…

Probability · Mathematics 2021-10-20 Konstantin Avrachenkov , Evsey Morozov , Ruslana Nekrasova

Stable states in complex systems correspond to local minima on the associated potential energy surface. Transitions between these local minima govern the dynamics of such systems. Precisely determining the transition pathways in complex and…

Machine Learning · Computer Science 2024-10-25 Adittya Pal

In many reinforcement learning (RL) applications, we want policies that reach desired states and then keep the controlled system within an acceptable region around the desired states over an indefinite period of time. This latter objective…

Machine Learning · Computer Science 2024-05-28 Brahma S. Pavse , Matthew Zurek , Yudong Chen , Qiaomin Xie , Josiah P. Hanna

In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of…

Discrete Mathematics · Computer Science 2019-07-25 Ágnes Cseh , Klaus Heeger

We propose a framework to assess how to optimally sort and grade students of heterogenous ability. Potential employers face uncertainty regarding an individual's productive value. Knowing which school an individual went to is useful for two…

Theoretical Economics · Economics 2024-02-06 Jacopo Bizzotto , Adrien Vigier