George P Papavassilopoulos | National Technical University of Athens (original) (raw)

George P Papavassilopoulos

PROFESSOR,DEPT.EE&CS,NTUA,ATHENS,GREECE

less

Uploads

Papers by George P Papavassilopoulos

Research paper thumbnail of Nash Social Distancing Games with Equity Constraints: How Inequality Aversion Affects the Spread of Epidemics

arXiv (Cornell University), Aug 31, 2020

Research paper thumbnail of Dynamic Games of Social Distancing during an Epidemic: Analysis of Asymmetric Solutions

arXiv (Cornell University), May 26, 2021

Research paper thumbnail of Network topology design to influence the effects of manipulative behaviors in a social choice procedure

arXiv (Cornell University), Mar 16, 2019

Research paper thumbnail of Development and numerical investigation of new non-linear Kalman filter variants

Iet Control Theory and Applications, Jul 7, 2011

Research paper thumbnail of Games of Social Distancing during an Epidemic: Local vs Statistical Information

arXiv (Cornell University), Jul 10, 2020

Research paper thumbnail of Network Design in the Presence of a Link Jammer: a Zero-Sum Game Formulation

IFAC-PapersOnLine, Jul 1, 2017

Research paper thumbnail of Games on Large Networks: Information and Complexity

IEEE Transactions on Automatic Control, Jul 1, 2017

Research paper thumbnail of Numerical Experience with Parallel Algorithms for Solving the BMI Problem

IFAC Proceedings Volumes, Jun 1, 1996

Research paper thumbnail of Stochastic Stability in Max-Product and Max-Plus Systems with Markovian Jumps

arXiv (Cornell University), Nov 8, 2017

Research paper thumbnail of A Mixed-Integer Programming Model for Assessing Energy-Saving Investments in Domestic Buildings under Uncertainty

Research paper thumbnail of On the linear-quadratic-Gaussian Nash game with one-step delay observation sharing pattern

IEEE Transactions on Automatic Control, Oct 1, 1982

This paper studies a two-player Nash dynamic, discrete-time, linear-quadratic game under the so-c... more This paper studies a two-player Nash dynamic, discrete-time, linear-quadratic game under the so-called "one-step delay observation sharing pattern." It is shown that under very weak assumptions the solution exists and is unique and linear in the information.

Research paper thumbnail of On the rank minimization problem over a positive semidefinite linear matrix inequality

IEEE Transactions on Automatic Control, 1997

Research paper thumbnail of Cooperative outcomes of dynamic stochastic Nash games

An examination is made of a stochastic dynamic discrete-time game, and the possibility of obtaini... more An examination is made of a stochastic dynamic discrete-time game, and the possibility of obtaining approximate Nash equilibria which result in Pareto outcomes is studied. The time horizon is infinite. In the context of a simple linear quadratic model strategies that may achieve the aforementioned aim are suggested, and several insights and results are discussed.<<ETX>>

Research paper thumbnail of A Mathematical Model for Deriving Optimal Leasing Policies of a Satellite Operator

Open journal of optimization, 2014

Research paper thumbnail of Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift

Research paper thumbnail of Algorithms for globally solving DC minimization problems via concave programming

Research paper thumbnail of Limiting Behavior of LQ Deterministic Infinite Horizon Nash Games with Symmetric Players as the Number of Players goes to Infinity

arXiv (Cornell University), Mar 13, 2014

Research paper thumbnail of On a class of decentralized discrete-time adaptive control problems

This paper considers a decentralized adaptive control problem for a class of discrete-time multi-... more This paper considers a decentralized adaptive control problem for a class of discrete-time multi-input multi-output deterministic linear systems. It is shown that, under a weak coupling condition, the Projection Algorithm will ensure that the system inputs and outputs remain bounded for all time and that each controller can successfully make the corresponding output tracking error converge to zero.

Research paper thumbnail of Convergence analysis of asynchronous linear iterations with stochastic delays

Parallel Computing, Mar 1, 1993

Abstract We present a general linear model of asynchronous iterations, the communication delays o... more Abstract We present a general linear model of asynchronous iterations, the communication delays of which are stochastic with Markovian character. This model allows static or dynamic allocation of the iterate vector components to processors. It also allows simultaneous updating of the same vector component by multiple processors. Sufficient conditions under which the model of asynchronous iterations converges in the second moment (and in the mean) to the sought solution are provided. For the specialization of the Markov case when the communication delays are independent, identically distributed (i.i.d.), we provide sufficient conditions for convergence in the second moment and necessary and sufficient conditions for convergence in the mean.

Research paper thumbnail of On The Convergence Of An Efficient Algorithm For Kullback-Leibler Approximation Of Spectral Densities

Research paper thumbnail of Nash Social Distancing Games with Equity Constraints: How Inequality Aversion Affects the Spread of Epidemics

arXiv (Cornell University), Aug 31, 2020

Research paper thumbnail of Dynamic Games of Social Distancing during an Epidemic: Analysis of Asymmetric Solutions

arXiv (Cornell University), May 26, 2021

Research paper thumbnail of Network topology design to influence the effects of manipulative behaviors in a social choice procedure

arXiv (Cornell University), Mar 16, 2019

Research paper thumbnail of Development and numerical investigation of new non-linear Kalman filter variants

Iet Control Theory and Applications, Jul 7, 2011

Research paper thumbnail of Games of Social Distancing during an Epidemic: Local vs Statistical Information

arXiv (Cornell University), Jul 10, 2020

Research paper thumbnail of Network Design in the Presence of a Link Jammer: a Zero-Sum Game Formulation

IFAC-PapersOnLine, Jul 1, 2017

Research paper thumbnail of Games on Large Networks: Information and Complexity

IEEE Transactions on Automatic Control, Jul 1, 2017

Research paper thumbnail of Numerical Experience with Parallel Algorithms for Solving the BMI Problem

IFAC Proceedings Volumes, Jun 1, 1996

Research paper thumbnail of Stochastic Stability in Max-Product and Max-Plus Systems with Markovian Jumps

arXiv (Cornell University), Nov 8, 2017

Research paper thumbnail of A Mixed-Integer Programming Model for Assessing Energy-Saving Investments in Domestic Buildings under Uncertainty

Research paper thumbnail of On the linear-quadratic-Gaussian Nash game with one-step delay observation sharing pattern

IEEE Transactions on Automatic Control, Oct 1, 1982

This paper studies a two-player Nash dynamic, discrete-time, linear-quadratic game under the so-c... more This paper studies a two-player Nash dynamic, discrete-time, linear-quadratic game under the so-called "one-step delay observation sharing pattern." It is shown that under very weak assumptions the solution exists and is unique and linear in the information.

Research paper thumbnail of On the rank minimization problem over a positive semidefinite linear matrix inequality

IEEE Transactions on Automatic Control, 1997

Research paper thumbnail of Cooperative outcomes of dynamic stochastic Nash games

An examination is made of a stochastic dynamic discrete-time game, and the possibility of obtaini... more An examination is made of a stochastic dynamic discrete-time game, and the possibility of obtaining approximate Nash equilibria which result in Pareto outcomes is studied. The time horizon is infinite. In the context of a simple linear quadratic model strategies that may achieve the aforementioned aim are suggested, and several insights and results are discussed.<<ETX>>

Research paper thumbnail of A Mathematical Model for Deriving Optimal Leasing Policies of a Satellite Operator

Open journal of optimization, 2014

Research paper thumbnail of Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift

Research paper thumbnail of Algorithms for globally solving DC minimization problems via concave programming

Research paper thumbnail of Limiting Behavior of LQ Deterministic Infinite Horizon Nash Games with Symmetric Players as the Number of Players goes to Infinity

arXiv (Cornell University), Mar 13, 2014

Research paper thumbnail of On a class of decentralized discrete-time adaptive control problems

This paper considers a decentralized adaptive control problem for a class of discrete-time multi-... more This paper considers a decentralized adaptive control problem for a class of discrete-time multi-input multi-output deterministic linear systems. It is shown that, under a weak coupling condition, the Projection Algorithm will ensure that the system inputs and outputs remain bounded for all time and that each controller can successfully make the corresponding output tracking error converge to zero.

Research paper thumbnail of Convergence analysis of asynchronous linear iterations with stochastic delays

Parallel Computing, Mar 1, 1993

Abstract We present a general linear model of asynchronous iterations, the communication delays o... more Abstract We present a general linear model of asynchronous iterations, the communication delays of which are stochastic with Markovian character. This model allows static or dynamic allocation of the iterate vector components to processors. It also allows simultaneous updating of the same vector component by multiple processors. Sufficient conditions under which the model of asynchronous iterations converges in the second moment (and in the mean) to the sought solution are provided. For the specialization of the Markov case when the communication delays are independent, identically distributed (i.i.d.), we provide sufficient conditions for convergence in the second moment and necessary and sufficient conditions for convergence in the mean.

Research paper thumbnail of On The Convergence Of An Efficient Algorithm For Kullback-Leibler Approximation Of Spectral Densities

Log In