English
Related papers

Related papers: An ODE Model for Dynamic Matching in Heterogeneous…

200 papers

Ordinary differential equations (ODEs) are foundational in modeling intricate dynamics across a gamut of scientific disciplines. Yet, a possibility to represent a single phenomenon through multiple ODE models, driven by different…

Methodology · Statistics 2023-09-01 Itai Dattner , Shota Gugushvili , Oleksandr Laskorunskyi

In this work, we study the multi-agent decision problem where agents try to coordinate to optimize a given system-level objective. While solving for the global optimal is intractable in many cases, the greedy algorithm is a well-studied and…

Multiagent Systems · Computer Science 2022-12-01 Rohit Konda , David Grimsman , Jason Marden

Ordinary differential equations (ODEs) provide a powerful framework for modeling dynamic systems arising in a wide range of scientific domains. However, most existing ODE methods focus on a single system, and do not adequately address the…

Methodology · Statistics 2026-04-08 Shuoxun Xu , Zijian Guo , Brooke R. Staveland , Robert T. Knight , Lexin Li

By interpreting the forward dynamics of the latent representation of neural networks as an ordinary differential equation, Neural Ordinary Differential Equation (Neural ODE) emerged as an effective framework for modeling a system dynamics…

Machine Learning · Computer Science 2020-10-19 Daehoon Gwak , Gyuhyeon Sim , Michael Poli , Stefano Massaroli , Jaegul Choo , Edward Choi

In this paper, we generalize the recently studied Stochastic Matching problem to more accurately model a significant medical process, kidney exchange, and several other applications. Up until now the Stochastic Matching problem that has…

Data Structures and Algorithms · Computer Science 2022-05-31 Alireza Farhadi , Jacob Gilbert , MohammadTaghi Hajiaghayi

We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the…

Data Structures and Algorithms · Computer Science 2014-06-10 Dariusz Dereniowski , Ralf Klasing , Adrian Kosowski , Łukasz Kuszner

We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and…

Data Structures and Algorithms · Computer Science 2018-03-06 Itai Ashlagi , Maximilien Burq , Patrick Jaillet , Amin Saberi

The online weighted matching problem is a fundamental problem in machine learning due to its numerous applications. Despite many efforts in this area, existing algorithms are either too slow or don't take $\mathrm{deadline}$ (the longest…

Data Structures and Algorithms · Computer Science 2025-02-19 Zhao Song , Weixin Wang , Chenbo Yin , Junze Yin

Real-world multi-agent systems are often dynamic and continuous, where the agents co-evolve and undergo changes in their trajectories and interactions over time. For example, the COVID-19 transmission in the U.S. can be viewed as a…

Machine Learning · Computer Science 2024-03-04 Zijie Huang , Jeehyun Hwang , Junkai Zhang , Jinwoo Baik , Weitong Zhang , Dominik Wodarz , Yizhou Sun , Quanquan Gu , Wei Wang

Modern artificial intelligence relies on networks of agents that collect data, process information, and exchange it with neighbors to collaboratively solve optimization and learning problems. This article introduces a novel distributed…

Optimization and Control · Mathematics 2026-01-15 Diego Deplano , Nicola Bastianello , Mauro Franceschelli , Karl H. Johansson

The design of algorithms or protocols that are able to align the goals of the planner with the selfish interests of the agents involved in these protocols is of paramount importance in almost every decentralized setting (such as, computer…

Computer Science and Game Theory · Computer Science 2023-02-28 Diodato Ferraioli , Carmine Ventre

We consider a well-studied online random graph model for kidney exchange, where nodes representing patient-donor pairs arrive over time, and the probability of a directed edge is p. We assume existence of a single altruistic donor, who…

Computer Science and Game Theory · Computer Science 2020-10-06 Avrim Blum , Yishay Mansour

We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets,…

Computer Science and Game Theory · Computer Science 2023-01-12 Yash Kanoria , Seungki Min , Pengyu Qian

Agent-based modeling and simulation is a useful method to study biological phenomena in a wide range of fields, from molecular biology to ecology. Since there is currently no agreed-upon standard way to specify such models it is not always…

Quantitative Methods · Quantitative Biology 2010-10-14 Franziska Hinkelmann , David Murrugarra , Abdul Salam Jarrah , Reinhard Laubenbacher

The use of differential equations (ODE) is one of the most promising approaches to network inference. The success of ODE-based approaches has, however, been limited, due to the difficulty in estimating parameters and by their lack of…

Molecular Networks · Quantitative Biology 2017-06-09 Yue Deng , Hector Zenil , Jesper Tégner , Narsis A. Kiani

For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among…

Information Theory · Computer Science 2013-10-29 Dennis Sundman , Saikat Chatterjee , Mikael Skoglund

Many scientific problems focus on observed patterns of change or on how to design a system to achieve particular dynamics. Those problems often require fitting differential equation models to target trajectories. Fitting such models can be…

Quantitative Methods · Quantitative Biology 2023-12-27 Steven A. Frank

Motivated by kidney exchange, we study a stochastic cycle and chain packing problem, where we aim to identify structures in a directed graph to maximize the expectation of matched edge weights. All edges are subject to failure, and the…

Artificial Intelligence · Computer Science 2020-07-08 Hoda Bidkhori , John P Dickerson , Duncan C McElfresh , Ke Ren

This paper studies the problem of modeling multi-agent dynamical systems, where agents could interact mutually to influence their behaviors. Recent research predominantly uses geometric graphs to depict these mutual interactions, which are…

Machine Learning · Computer Science 2024-06-28 Xiao Luo , Yiyang Gu , Huiyu Jiang , Hang Zhou , Jinsheng Huang , Wei Ju , Zhiping Xiao , Ming Zhang , Yizhou Sun

Random ordinary differential equations (RODEs), i.e. ODEs with random parameters, are often used to model complex dynamics. Most existing methods to identify unknown governing RODEs from observed data often rely on strong prior knowledge.…

Numerical Analysis · Mathematics 2020-06-04 Junyu Liu , Zichao Long , Ranran Wang , Jie Sun , Bin Dong