Establishing and assessing adaptive parking prices in a city: Algorithms, software and examples

Nir Fulman; Itzhak Benenson

Home/Archive/arXiv

arXiv · 1912.11631

Establishing and assessing adaptive parking prices in a city: Algorithms, software and examples

Nir Fulman·Itzhak Benenson

View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose ParkSage, a set of spatially-explicit algorithms for establishing parking prices that guarantee a predetermined occupancy rate over a city, and for evaluating the achieved reduction in parking search time. We apply ParkSage for establishing overnight parking prices that guarantee 85% occupation in the Israeli city of Bat Yam. Pricing by street links ensures high parking availability and close to zero cruising everywhere in the city, but is inconvenient for drivers. Establishing prices by the large and heterogeneous city quarters results in local mismatch between demand and supply, the emergence of areas with fully occupied on-street parking and a long search time for the drivers whose destinations are in these areas. We demonstrate that pricing by the medium sized Transportation Analysis Zones, which is easy enough for drivers to comprehend and abide by, is sufficient for eliminating cruising. The software for establishing and assessing performance parking prices is based on the standard municipal GIS layers of streets and parking lots and is available for free download from https://www.researchgame.net/profile/Nir_Fulman

Explore related subjects

physics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Nir Fulman, Itzhak Benenson. 2019-12-25. Establishing and assessing adaptive parking prices in a city: Algorithms, software and examples. https://arxiv.org/abs/1912.11631

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Self-Reference in Large Language Models: The Introspection Threshold for Recursive Self-Improvement

The pursuit of self-evolving AI raises a critical question: when is autonomous self-improvement sustainable rather than degenerative? Drawing an analogy to von Neumann's complexity threshold for self-reproducing automata, we argue that sustainable recursive self-improvement in Large Language Models (LLMs) requires a functional analogue: introspection -- the system's capacity to simulate its own operations and target modifications. Grounded in Kleene's Second Recursion Theorem, we demonstrate the theoretical existence of such introspective programs. However, an empirical review reveals that while current LLMs exhibit quasi-introspection (e.g., partial metacognition), they fall short of true introspection due to structural bottlenecks: a lack of complete self-access, the feedforward nature of the Transformer, and computational class constraints that prevent fixed-point iteration. We conclude by outlining architectural paths to cross this complexity threshold and discussing the associated safety implications.

physics.soc-ph↗

arXiv2026

Multilayer Analysis of the Global Trade Network

Global trade is more than a single network of aggregate flows. Beneath the observable exchange of products among economies lies a complex multilayer structure, formed by thousands of product-specific trade relationships that differ in their similarity, interdependence, and temporal evolution. Using the CEPII's BACI database, which records bilateral product-level trade flows between economies, we represent the global trade network from 1995 to 2024 as a temporal multilayer network, with economies as nodes and directed weighted trade flows as edges. To investigate product-level organisation and cross-layer similarity, temporal structural change, and the structural role of individual economies, we introduce a random-walk-based similarity measure that provides a unified framework for comparing weighted and directed trade layers. Our results show that the global trade network remains relatively stable over short periods but undergoes gradual structural change over longer timescales. We also find that similarity-based product communities only partially align with the official product taxonomy, indicating that products assigned to the same official category do not necessarily exhibit similar trade-network structures. Finally, we show that an economy's structural influence is not always determined by its trade volume. These results highlight the value of multilayer network analysis for revealing patterns in global trade that remain hidden at the aggregate level.

physics.soc-ph↗

arXiv2026

Detectability limits of scaling laws

Power law scaling relations between size and output are central to quantitative theories of cities, organisms, and other complex systems. Competing theories predict scaling exponents that differ by small fractions, but there is no existing theory for verifying whether a given dataset can even distinguish exponents at the required resolution to address such discrepancies. Here we derive a resolution limit for scaling exponents, giving the smallest exponent difference that any method of analysis can detect. We find that the Hurst exponents governing the evolution of systems' sizes and deviations from the scaling law determine how long a record of growing systems must be before it can separate competing scaling theories. Empirical results suggest that many available data panels are insufficient for reliable scaling model selection.

physics.soc-ph↗