Walid Krichene
Publications
scholar
arXiv
dblp
Journal articles
W. Krichene, J. Reilly, S. Amin, A. Bayen.
‘‘Stackelberg Routing on Parallel Networks with Horizontal Queues’’
IEEE Transactions on Automatic Control (2013).
http://dx.doi.org/10.1109/TAC.2013.2289709
bib
W. Krichene, B. Drighes, A. Bayen.
‘‘Learning Nash Equilibria in Congestion Games’’
SIAM Journal on Control and Optimization, in review.
M. Delle Monache, J. Reilly, S. Samaranayake, W. Krichene, P. Goatin, A. Bayen.
‘‘A PDEODE Model for a Junction with Ramp Buffer’’
Accepted, SIAM Journal on Applied Mathematics (2013).
SIAM epublication
bib
F. Farokhi, W. Krichene, A. M. Bayen, K. H. Johansson.
‘‘A Necessary and sufficient condition for Existence of Potential Functions for Heterogeneous Routing Games’’
Submitted to Automatica.
J. Reilly, W. Krichene, M. Delle Monache, P. Goatin, A. Bayen.
‘‘Adjointbased optimization on a network of discretized scalar conservation law PDEs with applications to coordinated ramp metering’’
Submitted to the Journal of Optimization Theory and Applications (JOTA)
Conference articles
W. Krichene, B. Drighes, A. Bayen.
On the convergence of noregret routing in selfsih routing
International Conference on Machine Learning (ICML) (2014).
Supplementary material
Slides
W. Krichene, J. Reilly, S. Amin, A. Bayen.
‘‘Characterization and Computation of Nash Equilibria in Parallel Netwoks with Horizontal Queues’’
51st IEEE Conference on Decision and Control (2012).
pdf bib
W. Krichene, J. Reilly, S. Amin, A. Bayen.
‘‘Stackelberg Routing on Parallel Networks with Horizontal Queues’’
51st IEEE Conference on Decision and Control (2012).
pdf bib
B. Drighes, W. Krichene, A. Bayen.
Stability of Nash Equilibria in the Congestion Game under Replicator Dynamics
53rd IEEE Conference on Decision and Control (2014).
Y. Jebbari, W. Krichene, J. Reilly, A. Bayen.
‘‘Stackelberg Thresholds on Parallel Networks with Horizontal Queues’’
52nd IEEE Conference on Decision and Control (2013).
bib
F. Farokhi, W. Krichene, A. M. Bayen, K. H. Johansson.
‘‘A Heterogeneous Routing Game’’
51st Annual Allerton Conference on Communication, Control, and Computing (2013).
bib
Technical reports
M. Balandat, W. Krichene, C. P. Lam, K. K. Lam.
‘‘Robust PCA, theory and applications’’ (Report for EE227A Introduction to convex optimization)
W. Krichene
‘‘Learning in games using convex optimization’’ (Report for EE227C Optimization for large scale data analysis)
‘‘Poster’’
Talks and presentations
On the convergence of online learning in selfish routing.
ICML 2014. June 23, 2014.
Talk
Routing games  Stackelberg routing and online learning.
UCSB control seminar. Santa Barbara, May 30, 2014.
Learning in finite games and convex potential games.
Bayen group meeting. Berkeley, May 12, 2014.
Learning and Games, an overview.
Semiautonomous group meeting. Berkeley, April 24, 2014.
Stackelberg Thresholds on Parallel Networks with Horizontal Queues.
Talk given at the 52nd IEEE Conference on Decision and Control, in Florence, Italy, December 10, 2013.
A Heterogeneous Routing Game.
Talk given at the 51st Annual Allerton Conference on Communication, Control, and Computing, October 2, 2013.
Online learning in routing games.
Talk given at the network economics seminar at Berkeley, October 18 2013.
On convergence of online learning in routing games.
Talk given at the semiautonomous group meeting at Berkeley, September 13 2013.
Selfish Routing and the Experts Algorithm.
Talk given at the CPS games seminar at Berkeley, May 17 2013.
Routing a subset of Drivers on a Highway Network under Noncooperative Response using Robust Stackelberg Routing.
Talk given at the Workshop on Robust and Stochastic Control Methods for Sustainable Engineering, 51st IEEE Conference on Decision and Control, Maui, Hawaii, December 14, 2012.
On Stackelberg Routing on Parallel Networks with Horizontal Queues.
Talk given at the 51st IEEE Conference on Decision and Control, Maui, Hawaii, December 13, 2012.
Adjointbased Control of Traffic Systems  Application to Ramp Metering.
Talk given with Samitha Samaranayake at the Connected Corridors research seminar, PATH (Partners for Advanced Transportation Tech nology), Berkeley, November 2012.
Stackelberg routing on horizontal queuing networks.
Talk given at the Netecon group, Berkeley, February 2012.
Introduction to learning theory.
Talk given at Criteo labs, Paris, June 2011.
Travel Time Estimation using Approximate Belief States on a Hidden Markov Model.
Talk given at Mines Paristech, Paris, France, September 2010.
