scholarly journals Wardrop Equilibrium in Discrete-Time Selfish Routing with Time-Varying Bounded Delays

2020 ◽  
pp. 1-1 ◽  
Author(s):  
Alessandro Giuseppi ◽  
Antonio Pietrabissa
Keyword(s):  
Discrete Time ◽  
Time Varying ◽  
Selfish Routing ◽  
Wardrop Equilibrium

Discrete-Time Selfish Routing Converging to the Wardrop Equilibrium

2019 ◽  
Vol 64 (3) ◽  
pp. 1288-1294 ◽  
Author(s):  
Antonio Pietrabissa ◽  
Lorenzo Ricciardi Celsi
Keyword(s):  
Discrete Time ◽  
Selfish Routing ◽  
Wardrop Equilibrium

Krein Space-based Hθ Fault Estimation for Linear Discrete Time-varying Systems

2009 ◽  
Vol 34 (12) ◽  
pp. 1529-1533 ◽  
Author(s):  
Mai-Ying ZHONG ◽  
Shuai LIU ◽  
Hui-Hong ZHAO
Keyword(s):  
Discrete Time ◽  
Krein Space ◽  
Fault Estimation ◽  
Time Varying ◽  
Time Varying Systems ◽  
Kreĭn Space

Robust Analysis for Premium-Reserve Models in a Stochastic Nonlinear Discrete-Time Varying Framework

2018 ◽  
Author(s):  
Rong Li ◽  
Athanasios A. Pantelous ◽  
Lin Yang
Keyword(s):  
Discrete Time ◽  
Time Varying ◽  
Robust Analysis

scholarly journals Discrete-Time Zeroing Dynamics with Quadruplicate Error Pattern for Time-Varying Linear Inequality

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jianhuang Cai ◽  
Qingshan Feng ◽  
Dongsheng Guo
Keyword(s):  
Discrete Time ◽  
Linear Inequality ◽  
Time Varying ◽  
Error Pattern

scholarly journals The VIT Transform Approach to Discrete-Time Signals and Linear Time-Varying Systems

Eng ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 99-125
Author(s):  
Edward W. Kamen
Keyword(s):  
Discrete Time ◽  
Initial Conditions ◽  
Linear Time ◽  
Order Term ◽  
Initial Time ◽  
Time Varying ◽  
Varying Coefficients ◽  
Time Signals ◽  
Time Varying Systems ◽  
Time Varying Coefficients

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z−1, which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z−i by time functions, which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of zi at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.

On the spectrum of discrete time-varying linear systems

2013 ◽  
Vol 9 ◽  
pp. 27-41 ◽  
Author(s):  
Adam Czornik ◽  
Michał Niezabitowski
Keyword(s):  
Linear Systems ◽  
Discrete Time ◽  
Time Varying

Exponential estimate with a time-varying factor for positive discrete-time systems with time-delays

2021 ◽  
Vol 119 ◽  
pp. 107194
Author(s):  
C.T. Tinh ◽  
P.T. Nam ◽  
T.N. Nguyen ◽  
H. Trinh
Keyword(s):  
Discrete Time ◽  
Time Delays ◽  
Exponential Estimate ◽  
Time Varying ◽  
Discrete Time Systems ◽  
Time Systems

scholarly journals Search for a moving target in a competitive environment

2021 ◽  
Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen
Keyword(s):  
Markov Chain ◽  
Discrete Time ◽  
Competitive Environment ◽  
Moving Target ◽  
Time Varying ◽  
Greedy Strategy ◽  
Time Dynamic ◽  
Dynamic Search ◽  
Subgame Perfect Equilibria ◽  
Perfect Equilibria

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

Sign in / Sign up

Export Citation Format

Share Document