相关论文: Multi-Commodity Nash Flows Over Time

We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/$1$ queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing waiting costs in…

Joint scheduling and routing of data flows with deadline constraints in communication networks has been attracting research interest. This type of problem distinguishes from conventional multicommodity flows due to the presence of the time…

We study dynamical fluctuations in overdamped diffusion processes driven by time periodic forces. This is done by studying fluctuation functionals (rate functions from large deviation theory), of fluctuations around the non-equilibrium…

Despite a substantial body of theoretical and empirical research in the fields of conjoint and discrete choice analysis as well as product line optimization, relatively few papers focused on the simulation of subsequent competitive dynamics…

Modelling passenger assignments in public transport networks is a fundamental task for city planners, especially when deliberating network infrastructure decisions. A key aspect of a realistic model is to integrate passengers' selfish…

Extending the famous Model B for the time evolution of a liquid mixture, we derive an approximate expression for the mobility matrix that couples the different mixture components. This approach is based on a single component fluid with…

Traditional DTA models of large cities suffer from prohibitive computation times and calibration/validation can become major challenges faced by practitioners. The empirical evidence in 2008 in support of the existence of a Macroscopic…

We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given…

We consider a large population dynamic game in discrete time. The peculiarity of the game is that players are characterized by time-evolving types, and so reasonably their actions should not anticipate the future values of their types. When…

In 2010s Fleiner introduced a notion of stable flows in directed networks and showed that such a flow always exists and can be found by use of a reduction to the stable allocation problem due to Baiou and Balinski. Recently Cseh and…

We provide an explicit rigorous derivation of a diffusion limit - a stochastic differential equation with additive noise - from a deterministic skew-product flow. This flow is assumed to exhibit time-scale separation and has the form of a…

In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are drawn at random. In particular, we focus on games where a large…

A three-dimensional chemotaxis-Navier-Stokes system is considered. It is known that for all suitably regular initial data, a corresponding initial-boundary value problem admits at least one global weak solution which can be obtained as the…

In this paper we present a new competitive packet routing model with edge priorities. We consider players that route selfishly through a network over time and try to reach their destinations as fast as possible. If the number of players who…

Measurements on real traffic have revealed the existence of metastable states with very high flow. Such states have not been observed in the Nagel-Schreckenberg (NaSch) model which is the basic cellular automaton for the description of…

We consider flows over time within the deterministic queueing model and study the solution concept of instantaneous dynamic equilibrium (IDE) in which flow particles select at every decision point a currently shortest path. The length of…

Normalizing Flows (NF) are Generative models which transform a simple prior distribution into the desired target. They however require the design of an invertible mapping whose Jacobian determinant has to be computable. Recently introduced,…

The problem of a car following a lead car driven with constant velocity is considered. To derive the governing equations for the following car dynamics a cost functional that ranks the outcomes of different driving strategies is…

Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers' route choices are influenced by information at multiple temporal and spatial scales. The considered model involves a continuum of…

In this tutorial, we provide an introduction to machine learning methods for finding Nash equilibria in games with large number of agents. These types of problems are important for the operations research community because of their…