Quickest Paths in Simulations of Pedestrians

This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model element is needed, if one wants to model and simulate pedestrians for whom travel time matters most (e.g. travelers in a station hall who are late for a train). Here such a model element is proposed, discussed and used within the Social Force Model.Comment: revised version submitte

Fintech and big tech credit: drivers of the growth of digital lending

Fintech and big tech companies are making rapid inroads into credit markets. We hand construct a global database of fintech and big tech lending volumes for 79 countries over 2013-2018. Using a panel regression analysis, we find these new forms of digital lending are larger in countries with higher GDP per capita (albeit at a declining rate), where banking sector mark-ups are higher, and where banking regulation is less stringent. We also find that these alternative forms of credit are more developed where the ease of doing business is greater, investor protection disclosure and the efficiency of the judicial system are more advanced, and where bond and equity markets are more developed. Overall, fintech and big tech credit seem to complement other forms of credit, rather than substitute for them

The problem of shot selection in basketball

In basketball, every time the offense produces a shot opportunity the player with the ball must decide whether the shot is worth taking. In this paper, I explore the question of when a team should shoot and when they should pass up the shot by considering a simple theoretical model of the shot selection process, in which the quality of shot opportunities generated by the offense is assumed to fall randomly within a uniform distribution. I derive an answer to the question "how likely must the shot be to go in before the player should take it?", and show that this "lower cutoff" for shot quality $f$ depends crucially on the number $n$ of shot opportunities remaining (say, before the shot clock expires), with larger $n$ demanding that only higher-quality shots should be taken. The function $f(n)$ is also derived in the presence of a finite turnover rate and used to predict the shooting rate of an optimal-shooting team as a function of time. This prediction is compared to observed shooting rates from the National Basketball Association (NBA), and the comparison suggests that NBA players tend to wait too long before shooting and undervalue the probability of committing a turnover.Comment: 7 pages, 2 figures; comparison to NBA data adde

Routing Games over Time with FIFO policy

We study atomic routing games where every agent travels both along its decided edges and through time. The agents arriving on an edge are first lined up in a \emph{first-in-first-out} queue and may wait: an edge is associated with a capacity, which defines how many agents-per-time-step can pop from the queue's head and enter the edge, to transit for a fixed delay. We show that the best-response optimization problem is not approximable, and that deciding the existence of a Nash equilibrium is complete for the second level of the polynomial hierarchy. Then, we drop the rationality assumption, introduce a behavioral concept based on GPS navigation, and study its worst-case efficiency ratio to coordination.Comment: Submission to WINE-2017 Deadline was August 2nd AoE, 201

On Unbounded Composition Operators in L2L^2-Spaces

Fundamental properties of unbounded composition operators in $L^2$-spaces are studied. Characterizations of normal and quasinormal composition operators are provided. Formally normal composition operators are shown to be normal. Composition operators generating Stieltjes moment sequences are completely characterized. The unbounded counterparts of the celebrated Lambert's characterizations of subnormality of bounded composition operators are shown to be false. Various illustrative examples are supplied

Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by a strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.Comment: 4 pages, 4 figures, final revised versio

Price of anarchy on heterogeneous traffic-flow networks

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the `price of anarchy'. This is the ratio of the cost incurred by agents who act to minimise their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability - parameterised by the proportion of variable-cost links in the network - changes, the behaviours that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of non-overlapping paths connecting source to destination nodes that are characterised by the number of variable-cost edges they contain. It is shown that localised peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect-ratio, variability and traffic load

Circulating angiogenic cell response to sprint interval and continuous exercise.

Although commonly understood as immune cells, certain T lymphocyte and monocyte subsets have angiogenic potential, contributing to blood vessel growth and repair. These cells are highly exercise responsive and may contribute to the cardiovascular benefits seen with exercise.Purpose: To compare the effects of a single bout of continuous (CONTEX) and sprint interval exercise (SPRINT) on circulating angiogenic cells (CAC) in healthy recreationally active adults.Methods: Twelve participants (aged 29 ±2y, BMI 25.5±0.9 kg.m-28 2, ̇O2peak 44.3±1.8 ml.kg-1.min-1; mean±SEM) participated in the study. Participants completed a 45 min bout of CONTEX at 70% peak oxygen uptake and 6x20 sec sprints on a 30 cycle ergometer, in a counterbalanced design. Blood was sampled pre-, post-, 2h and 24h post-31 exercise for quantification of CAC subsets by whole blood flow cytometric analysis. Angiogenic T lymphocytes (TANG) and angiogenic Tie2-expressing monocytes (TEM) were 33 identified by the expression of CD31 and Tie2 respectively.Results: Circulating (cells.μL-1) 34 CD3+CD31+TANG increased immediately post-exercise in both trials (