Results 51 to 60 of about 476 (159)

Game‐Theoretic Multi‐Agent Dynamic Traffic Assignment Using Congestion‐Aware Adaptive Learning

IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.
This paper proposes a novel game‐theoretic multi‐agent framework for dynamic traffic assignment problems, integrating congestion‐aware adaptive learning to simultaneously reduce individual travel time and improve overall network efficiency under dynamic congestion.
Dandan Wu, Shiru Qu, Xu He, Hongming Xu, Ji Li   +4 more
wiley   +1 more source

A Two‐Level Hierarchical Sparse DRL Framework for Coordinated Wide‐Area and Local Damping in DFIG‐Rich Low‐Inertia Grids

IET Renewable Power Generation, Volume 20, Issue 1, January/December 2026.
ABSTRACT This paper presents a two‐level hierarchical adaptive damping control strategy designed to robustly mitigate inter‐area low‐frequency oscillations (LFOs) in large‐scale power systems featuring high shares of doubly‐fed induction generator (DFIG) wind farms. The proposed structure integrates a central wide‐area damping controller (WADC), driven
Mohsen Darabian, Abdullah Ahmed Bawazir, Vipulkumar M. Dabhi, Ramneek Sidhu, Satish Choudhury   +4 more
wiley   +1 more source

Optimizing Electric Vehicle Charging Infrastructure on Highways: A MILP Model for Balanced Demand Allocation

International Journal of Energy Research, Volume 2026, Issue 1, 2026.
The strategic placement and sizing of electric vehicle (EV) charging stations on highways are critical for alleviating range anxiety and fostering widespread EV adoption. This paper presents a novel mixed‐integer linear programming (MILP) model for optimizing the location and capacity of charging stations along highway corridors.
Raka Jovanovic, Sertac Bayhan, I. Safak Bayram, Abdallah Bouabidi   +3 more
wiley   +1 more source

On Some Algorithmic and Structural Results on Flames

Journal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.
ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley   +1 more source

Control Node Placement and Structural Controllability of Water Quality Dynamics in Drinking Networks

Water Resources Research, Volume 61, Issue 12, December 2025.
Abstract Chlorine, the most widely used disinfectant, needs to be adequately distributed in water distribution networks (WDNs) to maintain consistent residual levels and ensure safe water. This is performed through control node injections at the treatment plant and via booster stations distributed across the WDNs.
Salma M. Elsherif, Ahmad F. Taha
wiley   +1 more source

Data and Competition: A Simple Framework

The RAND Journal of Economics, Volume 56, Issue 4, Page 494-510, Winter 2025.
ABSTRACT Does enhanced access to data foster or hinder competition among firms? Using a competition‐in‐utility framework that encompasses many situations where firms use data, we model data as a revenue‐shifter and identify two opposite effects: a mark‐up effect according to which data induces firms to compete harder, and a surplus‐extraction effect ...
Alexandre de Cornière, Greg Taylor
wiley   +1 more source

Multivariate Incomplete Information in the Mixture Model of Contests

The RAND Journal of Economics, Volume 56, Issue 4, Page 607-624, Winter 2025.
ABSTRACT A general mixture model of contests is introduced, combining stochastic performance and multivariate incomplete information. Performance is determined by a mixture distribution with endogenous weights on a good and bad distribution, respectively.
René Kirkegaard
wiley   +1 more source

Expected Maximization of a Concave Utility Function Under Threshold-Based Activation

Axioms
Maximizing the expected value of a concave and strictly increasing utility function defines a fundamental class of discrete optimization problems. Among them, coverage decision problems with diminishing marginal returns under uncertainty, typically ...
Guangming Li, Yufei Li, Shengjie Chen, Mou Sun, Wushuaijun Zhang   +4 more
doaj   +1 more source

Maximizing General Set Functions by Submodular Decomposition

, 2009
We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut function of a (simple, undirected) graph G with vertex set V, our original problem is reduced to a sequence of submodular maximization problems.
openaire   +2 more sources

Shape preserving properties and monotonicity properties of the sequences of Choquet type integral operators

Journal of Numerical Analysis and Approximation Theory, 2018
In this paper, for the univariate Bernstein-Kantorovich-Choquet, Szasz-Kantorovich-Choquet, Baskakov-Kantorovich-Choquet and Bernstein-Durrmeyer-Choquet operators written in terms of the Choquet integrals with respect to monotone and submodular set ...
Sorin Gal
doaj   +2 more sources