Sina Arefizadeh
YOU?
Author Swipe
View article: On Non-Monotone Variational Inequalities
On Non-Monotone Variational Inequalities Open
In this paper, we provide some sufficient conditions for the existence of solutions to non-monotone Variational Inequalities (VIs) based on inverse mapping theory and degree theory. We have obtained several applicable sufficient conditions…
View article: Non-Monotone Variational Inequalities
Non-Monotone Variational Inequalities Open
In this paper, we focus on deriving some sufficient conditions for the existence of solutions to non-monotone Variational Inequalities (VIs) based on inverse mapping theory. We have obtained several widely applicable sufficient conditions …
View article: P2P Trade With Prosumers’ Actual Approximate Utility Functions Within Near-Potential Games Framework
P2P Trade With Prosumers’ Actual Approximate Utility Functions Within Near-Potential Games Framework Open
There is a potential conflict between P2P trade and distribution network operator (DSO) decisions, which slows down the expansion of P2P trade.Expanding the P2P trade requires reducing this conflict and increasing DSO awareness of the actu…
View article: On Characterizations of Potential and Ordinal Potential Games
On Characterizations of Potential and Ordinal Potential Games Open
This paper investigates some necessary and sufficient conditions for a game to be a potential game. At first, we extend the classical results of Slade and Monderer and Shapley from games with one-dimensional action spaces to games with mul…
View article: Characterization of Potential Games: Application in Aggregative Games
Characterization of Potential Games: Application in Aggregative Games Open
The main objective of this work is to describe games which fall under title of Potential and simplify the conditions for class of aggregative games. Games classified as aggregative are ones in which, in addition to the player's own action,…
View article: Robustness of Dynamics in Games: A Contraction Mapping Decomposition Approach
Robustness of Dynamics in Games: A Contraction Mapping Decomposition Approach Open
A systematic framework for analyzing dynamical attributes of games has not been well-studied except for the special class of potential or near-potential games. In particular, the existing results have shortcomings in determining the asympt…
View article: Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games
Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games Open
We investigate convergence of decentralized fictitious play (DFP) in near-potential games, wherein agents preferences can almost be captured by a potential function. In DFP agents keep local estimates of other agents' empirical frequencies…
View article: Decentralized Fictitious Play in Near-Potential Games with Time-Varying\n Communication Networks
Decentralized Fictitious Play in Near-Potential Games with Time-Varying\n Communication Networks Open
We study the convergence properties of decentralized fictitious play (DFP)\nfor the class of near-potential games where the incentives of agents are nearly\naligned with a potential function. In DFP, agents share information only with\nthe…
View article: Decentralized Fictitious Play in Near-Potential Games with Time-Varying Communication Networks
Decentralized Fictitious Play in Near-Potential Games with Time-Varying Communication Networks Open
We study the convergence properties of decentralized fictitious play (DFP) for the class of near-potential games where the incentives of agents are nearly aligned with a potential function. In DFP, agents share information only with their …
View article: Distributed Fictitious Play in Potential Games with Time-Varying\n Communication Networks
Distributed Fictitious Play in Potential Games with Time-Varying\n Communication Networks Open
We propose a distributed algorithm for multiagent systems that aim to\noptimize a common objective when agents differ in their estimates of the\nobjective-relevant state of the environment. Each agent keeps an estimate of\nthe environment …
View article: Distributed Fictitious Play in Potential Games with Time Varying Communication Networks
Distributed Fictitious Play in Potential Games with Time Varying Communication Networks Open
We propose a distributed algorithm for multiagent systems that aim to optimize a common objective when agents differ in their estimates of the objective-relevant state of the environment. Each agent keeps an estimate of the environment and…
View article: Collaborative Platooning of Automated Vehicles Using Variable Time-Gaps
Collaborative Platooning of Automated Vehicles Using Variable Time-Gaps Open
Connected automated vehicles (CAVs) could potentially be coordinated to safely attain the maximum traffic flow on roadways under dynamic traffic patterns, such as those engendered by the merger of two strings of vehicles due a lane drop. S…
View article: Assessing Strong String Stability of Constant Spacing Policy under Speed Limit Fluctuations
Assessing Strong String Stability of Constant Spacing Policy under Speed Limit Fluctuations Open
The speed limit changes frequently throughout the transportation network, due to either safety (e.g., change in geometry) or congestion management (e.g., speed harmonization systems). Any abrupt reduction in the speed limit can create a sh…
View article: Platooning in the Presence of a Speed Drop: A Generalized Control Model
Platooning in the Presence of a Speed Drop: A Generalized Control Model Open
The positive impacts of platooning on travel time reliability, congestion, emissions, and energy consumption have been shown for homogeneous roadway segments. However, speed limit changes frequently throughout the transportation network, d…