 
    Panayotis Mertikopoulos
                                    148 
                                    
                            Documents
                                Présentation
I am a principal researcher at the French National Center for Scientific Research (CNRS), where I am a member of the Inria/LIG research team POLARIS. My research interests are somewhat eclectic, and they span the interface of game theory, learning and optimization, with a special view towards their applications to machine learning, operations research, and network theory. I’m especially interested in the long-run behavior of game-theoretic learning and optimization algorithms and dynamics – whether they converge, at what speed, and/or what type of non-stationary, off-equilibrium behaviors may arise when they do not.
Publications
                    
                    
                    22
                
                            
                    
                    
                    22
                
                            
                    
                    
                    13
                
                            
                    
                    
                    12
                
                            
                    
                    
                    9
                
                            
                    
                    
                    9
                
                            
                    
                    
                    8
                
                            
                    
                    
                    7
                
                            
                    
                    
                    7
                
                            
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    6
                
                            
                    
                    
                    11
                
                            
                    
                    
                    7
                
                            
                    
                    
                    18
                
                            
                    
                    
                    14
                
                            
                    
                    
                    13
                
                            
                    
                    
                    10
                
                            
                    
                    
                    11
                
                            
                    
                    
                    15
                
                            
                    
                    
                    12
                
                            
                    
                    
                    7
                
                            
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    3
                
                            
                    
                    
                    4
                
                            
                    
                    
                    1
                
                            
                    
                    
                    2
                
                            
                    
                    
                    3
                
                            
                    
                    
                    1
                
                    Publications
|  | The global convergence of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviationsICML 2025 - 42nd International Conference on Machine Learning, Jul 2025, Vancouver, Canada. pp.1-67Communication dans un congrès
                    
        
        
            
                
                    hal-05136755
                                            v1 | 
|  | Tamed Langevin sampling under weaker conditionsAISTATS 2025 - 28th International Conference on Artificial Intelligence and Statistics, May 2025, Mai Khao, Thailand. pp.1-32Communication dans un congrès
                    
        
        
            
                
                    hal-04629313
                                            v1 | 
|  | The impact of uncertainty on regularized learning in gamesICML 2025 - 42nd International Conference on Machine Learning, Jul 2025, Vancouver, Canada. pp.1-50Communication dans un congrès
                    
        
        
            
                
                    hal-05136772
                                            v1 | 
|  | Accelerated regularized learning in finite N-person gamesNeurIPS 2024 - 38th Conference on Neural Information Processing Systems, Dec 2024, Vancouver, Canada. pp.1-30Communication dans un congrès
                    
        
        
            
                
                    hal-04863626
                                            v1 | 
|  | A geometric decomposition of finite games: Convergence vs. recurrence under exponential weightsICML 2024 - 41st International Conference on Machine Learning, Jul 2024, Vienna, AustriaCommunication dans un congrès
                    
        
        
            
                
                    hal-04629310
                                            v1 | 
|  | The computational complexity of finding second-order stationary pointsICML 2024 - 41st International Conference on Machine Learning, Jul 2024, Vienna, AustriaCommunication dans un congrès
                    
        
        
            
                
                    hal-04629307
                                            v1 | 
|  | What is the long-run distribution of stochastic gradient descent? A large deviations analysisICML 2024 - 41st International Conference on Machine Learning, Jul 2024, Vienna, Austria. pp.1-70Communication dans un congrès
                    
        
        
            
                
                    hal-04629305
                                            v1 | 
|  | No-regret learning in harmonic games: Extrapolation in the face of conflicting interestsNeurIPS 2024 - 38th Conference on Neural Information Processing Systems, Dec 2024, Vancouver, Canada. pp.1-36Communication dans un congrès
                    
        
        
            
                
                    hal-04863624
                                            v1 | 
|  | A quadratic speedup in finding Nash equilibria of quantum zero-sum gamesQTML 2023 - Annual international conference on Quantum Techniques in Machine Learning, Nov 2023, CERN, Switzerland. pp.1-54Communication dans un congrès
                    
        
        
            
                
                    hal-04312987
                                            v1 | 
|  | Exploiting hidden structures in non-convex games for convergence to Nash equilibriumNeurIPS 2023 - 37th Conference on Neural Information Processing Systems, Dec 2023, New Orleans (LA), United States. pp.1-32Communication dans un congrès
                    
        
        
            
                
                    hal-04312981
                                            v1 | 
|  | Riemannian stochastic optimization methods avoid strict saddle pointsNeurIPS 2023 - 37th Conference on Neural Information Processing Systems, Dec 2023, New Orleans (LA), United States. pp.1-27Communication dans un congrès
                    
        
        
            
                
                    hal-04307876
                                            v1 | 
|  | The stability of matrix multiplicative weights dynamics in quantum gamesCDC 2023 - 62nd IEEE Conference on Decision and Control, Dec 2023, Singapore, Singapore. pp.1-8Communication dans un congrès
                    
        
        
            
                
                    hal-04307803
                                            v1 | 
|  | Payoff-based learning with matrix multiplicative weights in quantum gamesNeurIPS 2023 - 37th Conference on Neural Information Processing Systems, Dec 2023, New Orleans (LA), United States. pp.1-39Communication dans un congrès
                    
        
        
            
                
                    hal-04307824
                                            v1 | 
|  | The equivalence of dynamic and strategic stability under regularized learning in gamesNeurIPS 2023 - 37th Conference on Neural Information Processing Systems, Dec 2023, New Orleans (LA), United States. pp.1-31Communication dans un congrès
                    
        
        
            
                
                    hal-04307883
                                            v1 | 
|  | On the convergence of policy gradient methods to Nash equilibria in general stochastic gamesNeurIPS 2022 - 36th International Conference on Neural Information Processing Systems, Nov 2022, New Orleans, United States. pp.1-43Communication dans un congrès
                    
        
        
            
                
                    hal-03874018
                                            v1 | 
|  | Asymptotic Degradation of Linear Regression Estimates with Strategic Data SourcesALT 2022 - 33rd International Conference on Algorithmic Learning Theory, Mar 2022, Paris, France. pp.1-31Communication dans un congrès
                    
        
        
            
                
                    hal-03593516
                                            v1 | 
|  | UnderGrad: A universal black-box optimization method with almost dimension-free convergence rate guaranteesICML 2022 - 39th International Conference on Machine Learning, Jul 2022, Baltimore, United States. pp.1-31Communication dans un congrès
                    
        
        
            
                
                    hal-03874041
                                            v1 | 
|  | Learning in games with quantized payoff observationsCDC 2022 - 61st IEEE Annual Conference on Decision and Control, Dec 2022, Cancun, Mexico. pp.1-8Communication dans un congrès
                    
        
        
            
                
                    hal-03874022
                                            v1 | 
|  | Online convex optimization in wireless networks and beyond: The feedback -performance trade-offRAWNET 2022 - International Workshop on Resource Allocation and Cooperation in Wireless Networks, Sep 2022, Turin, Italy. pp.1-8, ⟨10.23919/wiopt56218.2022.9930534⟩Communication dans un congrès
                    
        
        
            
                
                    hal-03737125
                                            v2 | 
|  | The dynamics of Riemannian Robbins-Monro algorithmsCOLT 2022 - 35th Annual Conference on Learning Theory, Jul 2022, London, United Kingdom. pp.1-31Communication dans un congrès
                    
        
        
            
                
                    hal-03874052
                                            v1 | 
|  | No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate SeparationNeurIPS 2022 - 36th International Conference on Neural Information Processing Systems, Nov 2022, New Orleans, United StatesCommunication dans un congrès
                    
        
        
            
                
                    hal-03694134
                                            v1 | 
|  | Pick your neighbor: Local Gauss-Southwell rule for fast asynchronous decentralized optimizationCDC 2022 - 61st IEEE Annual Conference on Decision and Control, Dec 2022, Cancun, MexicoCommunication dans un congrès
                    
        
        
            
                
                    hal-03790278
                                            v1 | 
|  | Optimization in open networks via dual averagingCDC 2021 - 60th IEEE Annual Conference on Decision and Control, Dec 2021, Austin, TX, United States. pp.1-7, ⟨10.1109/CDC45484.2021.9683558⟩Communication dans un congrès
                    
        
        
            
                
                    hal-03342395
                                            v1 | 
| Online learning in multi-agent systems: Regret, equilibrium, and the road ahead23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, FranceCommunication dans un congrès
                    
        
        
            
                
                    hal-03595344
                                            v1 | |
|  | AdaGrad avoids saddle pointsICML 2022 - 39th International Conference on Machine Learning, Jul 2022, Baltimore, United States. pp.1-41Communication dans un congrès
                    
        
        
            
                
                    hal-03874036
                                            v1 | 
|  | Nested banditsICML 2022 - 39th International Conference on Machine Learning, Jul 2022, Baltimore, MA, United StatesCommunication dans un congrès
                    
        
        
            
                
                    hal-03874048
                                            v1 | 
|  | Equilibrium tracking and convergence in dynamic gamesCDC 2021 - 60th IEEE Annual Conference on Decision and Control, Dec 2021, Austin, United States. pp.1-8Communication dans un congrès
                    
        
        
            
                
                    hal-03342397
                                            v1 | 
|  | Fast routing under uncertainty: Adaptive learning in congestion games with exponential weightsNeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Unknown Region. pp.1-36Communication dans un congrès
                    
        
        
            
                
                    hal-03357716
                                            v1 | 
|  | Adaptive first-order methods revisited: Convex optimization without Lipschitz requirementsNeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-03342998
                                            v1 | 
|  | Survival of the strictest: Stable and unstable equilibria under regularized learning with partial informationCOLT 2021 - 34th Annual Conference on Learning Theory, Aug 2021, Boulder, United States. pp.1-30Communication dans un congrès
                    
        
        
            
                
                    hal-03342404
                                            v1 | 
|  | Adaptive learning in continuous games: Optimal regret bounds and convergence to Nash equilibriumCOLT 2021 - the 34th Annual Conference on Learning Theory, Aug 2021, Boulder, United States. pp.2388-2422, ⟨10.48550/arXiv.2104.12761⟩Communication dans un congrès
                    
        
        
            
                
                    hal-03342410
                                            v1 | 
|  | Sifting through the noise: Universal first-order methods for stochastic variational inequalitiesNeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Unknown Region. pp.1-39Communication dans un congrès
                    
        
        
            
                
                    hal-03357714
                                            v1 | 
|  | Regret minimization in stochastic non-convex learning via a proximal-gradient approachICML 2021 - 38th International Conference on Machine Learning, Jul 2021, Vienna, AustriaCommunication dans un congrès
                    
        
        
            
                
                    hal-03043872
                                            v1 | 
|  | The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalitiesCOLT 2021 - 34th Annual Conference on Learning Theory, Aug 2021, Boulder, United States. pp.1-32, ⟨10.48550/arXiv.2107.01906⟩Communication dans un congrès
                    
        
        
            
                
                    hal-03342583
                                            v1 | 
|  | Zeroth-order non-convex learning via hierarchical dual averagingICML 2021 - 38th International Conference on Machine Learning, Jul 2021, Vienna, Austria. pp.1-34Communication dans un congrès
                    
        
        
            
                
                    hal-03341912
                                            v1 | 
|  | Adaptive extra-gradient methods for min-max optimization and gamesICLR 2021 - 9th International Conference on Learning Representations, May 2021, Virtual, Unknown Region. pp.1-28Communication dans un congrès
                    
        
        
            
                
                    hal-03342601
                                            v1 | 
|  | The limits of min-max optimization algorithms: Convergence to spurious non-critical setsICML 2021 - 38th International Conference on Machine Learning, Jul 2021, Vienna, AustriaCommunication dans un congrès
                    
        
        
            
                
                    hal-03043862
                                            v1 | 
|  | The convergence rate of regularized learning in games: From bandits and uncertainty to optimism and beyondNeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Unknown Region. pp.1-28Communication dans un congrès
                    
        
        
            
                
                    hal-03357715
                                            v1 | 
|  | Derivative-Free Optimization over Multi-User MIMO NetworksNetGCoop '20: The 2020 International Conference on Network Games, Control and Optimization, 2020, Cargese, FranceCommunication dans un congrès
                    
        
        
            
                
                    hal-02881559
                                            v1 | 
|  | Online and Stochastic Optimization beyond Lipschitz Continuity: A Riemannian ApproachICLR 2020 - International Conference on Learning Representations, Apr 2020, Addis Ababa, Ethiopia. pp.1-20Communication dans un congrès
                    
        
        
            
                
                    hal-03043671
                                            v1 | 
|  | Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize ScalingNeurIPS '20 - 34th International Conference on Neural Information Processing Systems, Dec 2020, Vancouver / Virtual, Canada. pp.16223--16234Communication dans un congrès
                    
        
        
            
                
                    hal-03002844
                                            v1 | 
|  | No-regret learning and mixed Nash equilibria: They do not mixNeurIPS 2020 - 34th International Conference on Neural Information Processing Systems, Dec 2020, Vancouver, Canada. pp.1-24Communication dans un congrès
                    
        
        
            
                
                    hal-03043763
                                            v1 | 
|  | Quick or cheap? Breaking points in dynamic marketsEC 2020 - 21st ACM Conference on Economics and Computation, Jul 2020, Budapest, Hungary. pp.1-32Communication dans un congrès
                    
        
        
            
                
                    hal-03043688
                                            v1 | 
|  | A new regret analysis for Adam-type algorithmsICML 2020 - 37th International Conference on Machine Learning, Jul 2020, Vienna, Austria. pp.1-10Communication dans un congrès
                    
        
        
            
                
                    hal-03043697
                                            v1 | 
|  | Finite-time last-iterate convergence for multi-agent learning in gamesICML 2020 - 37th International Conference on Machine Learning, Jul 2020, Vienna, Austria. pp.1-11Communication dans un congrès
                    
        
        
            
                
                    hal-03043711
                                            v1 | 
|  | On the almost sure convergence of stochastic gradient descent in non-convex problemsNeurIPS 2020 - 34th International Conference on Neural Information Processing Systems, Dec 2020, Vancouver, Canada. pp.1-32Communication dans un congrès
                    
        
        
            
                
                    hal-03043771
                                            v1 | 
|  | Gradient-free Online Learning in Games with Delayed RewardsICML 2020 - 37th International Conference on Machine Learning, Jul 2020, Vienna, Austria. pp.1-11Communication dans un congrès
                    
        
        
            
                
                    hal-03043703
                                            v1 | 
|  | Online non-convex optimization with imperfect feedbackNeurIPS 2020 - 34th International Conference on Neural Information Processing Systems, 2020, Vancouver, CanadaCommunication dans un congrès
                    
        
        
            
                
                    hal-03043746
                                            v1 | 
|  | An adaptive mirror-prox algorithm for variational inequalities with singular operatorsNeurIPS 2019, 2019, Vancouver, CanadaCommunication dans un congrès
                    
        
        
            
                
                    hal-02403562
                                            v1 | 
|  | On the Convergence of Single-Call Stochastic Extra-Gradient MethodsAdvances in Neural Information Processing Systems, Dec 2019, Vancouver, CanadaCommunication dans un congrès
                    
        
        
            
                
                    hal-02403555
                                            v1 | 
|  | Gradient-free Online Resource Allocation Algorithms for Dynamic Wireless NetworksSPAWC 2019 - 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, Jul 2019, Cannes, France. pp.1-4, ⟨10.1109/SPAWC.2019.8815409⟩Communication dans un congrès
                    
        
        
            
                
                    hal-02189108
                                            v1 | 
|  | Fog Based Framework for IoT Service ProvisioningCCNC 2019 - IEEE Consumer Communications & Networking Conference, Jan 2019, Las Vegas, United States. pp.1-6, ⟨10.1109/CCNC.2019.8651835⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01859695
                                            v1 | 
|  | Convergent Noisy forward-backward-forward algorithms in non-monotone variational inequalitiesLSS 2019 - 15th IFAC Symposium on Large Scale Complex Systems: Theory and Applications, May 2019, Delft, Netherlands. pp.120-125, ⟨10.1016/j.ifacol.2019.06.021⟩Communication dans un congrès
                    
        
        
            
                
                    hal-02405750
                                            v1 | 
|  | Optimistic Mirror Descent in Saddle-Point Problems: Going the Extra (Gradient) MileICLR 2019 - 7th International Conference on Learning Representations, May 2019, New Orleans, United States. pp.1-23Communication dans un congrès
                    
        
        
            
                
                    hal-02111937
                                            v2 | 
|  | Load Aware Provisioning of IoT Services on Fog Computing PlatformIEEE International Conference on Communications (ICC), May 2019, Shanghai, China. ⟨10.1109/ICC.2019.8762052⟩Communication dans un congrès
                    
        
        
            
                
                    hal-02056743
                                            v1 | 
|  | Cycles in adversarial regularized learningSODA '18 - Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.2703-2717Communication dans un congrès
                    
        
        
            
                
                    hal-01643338
                                            v1 | 
|  | Power Control with Random Delays: Robust Feedback AveragingCDC 2018 - 57th IEEE Conference on Decision and Control, Dec 2018, Miami Beach, United States. pp.1-6Communication dans un congrès
                    
        
        
            
                
                    hal-01891528
                                            v1 | 
|  | Bandit learning in concave N-person gamesNIPS 2018 - Thirty-second Conference on Neural Information Processing Systems, Dec 2018, Montréal, Canada. pp.1-24Communication dans un congrès
                    
        
        
            
                
                    hal-01891523
                                            v1 | 
|  | Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go?ICML 2018 - 35th International Conference on Machine Learning, Jul 2018, Stockholm, Sweden. pp.1-10Communication dans un congrès
                    
        
        
            
                
                    hal-01891449
                                            v1 | 
|  | Learning in Games with Lossy FeedbackNIPS 2018 - Thirty-second Conference on Neural Information Processing Systems, Dec 2018, Montreal, Canada. pp.1-11Communication dans un congrès
                    
        
        
            
                
                    hal-01904461
                                            v1 | 
|  | A resource allocation framework for network slicingINFOCOM 2018 - IEEE International Conference on Computer Communications, Apr 2018, Honolulu, United States. pp.1-9Communication dans un congrès
                    
        
        
            
                
                    hal-01643349
                                            v1 | 
|  | On the convergence of stochastic forward-backward-forward algorithms with variance reduction in pseudo-monotone variational inequalitiesNIPS 2018 - Workshop on Smooth Games, Optimization and Machine Learning, Dec 2018, Montréal, Canada. pp.1-5Communication dans un congrès
                    
        
        
            
                
                    hal-01949361
                                            v1 | 
| Learning with bandit feedback in potential gamesNIPS '17: Proceedings of the 31st International Conference on Neural Information Processing Systems, Dec 2017, Long Beach, CA, United StatesCommunication dans un congrès
                    
        
        
            
                
                    hal-01643352
                                            v1 | |
| Countering feedback delays in multi-agent learningNIPS '17: Proceedings of the 31st International Conference on Neural Information Processing Systems, Dec 2017, Long Beach, CA, United StatesCommunication dans un congrès
                    
        
        
            
                
                    hal-01643350
                                            v1 | |
| Least action routing: Identifying the optimal path in a wireless relay networkPIMRC'17: 28th annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 2017, Montreal, CanadaCommunication dans un congrès
                    
        
        
            
                
                    hal-01643351
                                            v1 | |
| The asymptotic behavior of the price of anarchyWINE 2017: Proceedings of the 13th Conference on Web and Internet Economics, Dec 2017, Bangalore, IndiaCommunication dans un congrès
                    
        
        
            
                
                    hal-01643345
                                            v1 | |
| Mirror descent learning in continuous gamesCDC '17: Proceedings of the 56th IEEE Annual Conference on Decision and Control, Dec 2017, Melbourne, AustraliaCommunication dans un congrès
                    
        
        
            
                
                    hal-01643341
                                            v1 | |
| Power control in wireless networks via dual averagingGLOBECOM '17: Proceedings of the 2017 IEEE Global Telecommunications Conference, Dec 2017, Singapore, SingaporeCommunication dans un congrès
                    
        
        
            
                
                    hal-01643339
                                            v1 | |
|  | Hedging under uncertainty: regret minimization meets exponentially fast convergenceSymposium on Algorithmic Game Theory (SAGT) 2017, Sep 2017, L'Aquila, Italy. ⟨10.1007/978-3-319-66700-3_20⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01382290
                                            v1 | 
| Convergence to Nash equilibrium in continuous games with noisy first-order feedbackCDC '17: Proceedings of the 55th IEEE Annual Conference on Decision and Control, Dec 2017, Melbourne, AustraliaCommunication dans un congrès
                    
        
        
            
                
                    hal-01643347
                                            v1 | |
| Stochastic mirror descent for variationally coherent optimization problemsNIPS '17: Proceedings of the 31st International Conference on Neural Information Processing Systems, Dec 2017, Long Beach, CA, United StatesCommunication dans un congrès
                    
        
        
            
                
                    hal-01643342
                                            v1 | |
|  | Online Power Allocation for Opportunistic Radio Access in Dynamic OFDM Networks2016 IEEE 84th Vehicular Technology Conference (VTC2016-Fall), Sep 2016, Montreal, CanadaCommunication dans un congrès
                    
        
        
            
                
                    hal-01387044
                                            v1 | 
| A novel dynamic network architecture model based on stochastic geometry and game theoryICC '16: Proceedings of the 2016 IEEE International Conference on Communications, 2016, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382274
                                            v1 | |
|  | Online Interference Mitigation via Learning in Dynamic IoT EnvironmentsIEEE WORKSHOP GLOBECOM 2016, Dec 2016, Washington, DC, United StatesCommunication dans un congrès
                    
        
        
            
                
                    hal-01387046
                                            v1 | 
|  | Distributed learning for resource allocation under uncertaintyGlobalSIP 2016 - IEEE Global Conference on Signal and Information Processing, Dec 2016, Washington, United States. ⟨10.1109/globalsip.2016.7905899⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01382284
                                            v1 | 
| Energy-efficient power allocation in dynamic multi-carrier systemsVTC Spring 2015: Proceedings of the 2015 IEEE Vehicular Technology Conference, 2015, Glasgow, Scotland, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382293
                                            v1 | |
| No more tears: A no-regret approach to power control in dynamically varying MIMO networksWiOpt '15: Proceedings of the 13th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2015, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382294
                                            v1 | |
| Cost-efficient power allocation in OFDMA cognitive radio networksEUCNC' 15: Proceedings of the 2015 European Conference on Networks and Communications, 2015, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382292
                                            v1 | |
| Distributed Optimization in Multi-User MIMO Systems with Imperfect and Delayed InformationISIT '14: Proceedings of the 2014 IEEE International Symposium on Information Theory, 2014, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382297
                                            v1 | |
| No regrets: Distributed power control under time-varying channels and QoS requirementsAllerton '14: Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing, 2014, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382300
                                            v1 | |
|  | Energy-Aware Competitive Link Adaptation in Small-Cell Networks12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), May 2014, Hammamet, Tunisia. ⟨10.1109/wiopt.2014.6850272⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01098846
                                            v1 | 
| Adaptive transmit policies for cost-efficient power allocation in multi-carrier systemsWiOpt '14: Proceedings of the 12th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2014, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382298
                                            v1 | |
| Adaptive Spectrum Management in MIMO-OFDM Cognitive Radio: An Exponential Learning ApproachValueTools '13: Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, 2013, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382305
                                            v1 | |
| Riemannian-Geometric Optimization Methods for MIMO Multiple Access ChannelsISIT '13: Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382304
                                            v1 | |
| Accelerating Population-Based Search Heuristics by Adaptive Resource AllocationGECCO '13: Proceedings of the 15th ACM Annual Conference on Genetic and Evolutionary Computation, 2013, Unknown, Unknown Region. pp.1165-1172Communication dans un congrès
                    
        
        
            
                
                    hal-01382302
                                            v1 | |
| Entropy-Driven Optimization Dynamics for Gaussian Vector Multiple Access ChannelsICC '13: Proceedings of the 2013 IEEE International Conference on Communications, 2013, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382301
                                            v1 | |
| Matrix Exponential Learning: Distributed Optimization in MIMO systemsIEEE International Symposium on Information Theory (ISIT), Jul 2012, United States. pp.3028 -- 3032Communication dans un congrès
                    
        
        
            
                
                    hal-00741823
                                            v1 | |
| Strange bedfellows: Riemann, Gibbs and vector Gaussian multiple access channelsNetGCoop'12: Proceedings of the 6th International Conference on Network Games, Control and Optimization, 2012, UnknownCommunication dans un congrès
                    
        
        
            
                
                    hal-00788010
                                            v1 | |
| Dynamic power allocation games in parallel multiple access channelsValueTools'11: ACM Proceedings of the 5th International Conference on Performance Evaluation Methodologies and Tools, May 2011, Cachan, France. pp.332-341Communication dans un congrès
                    
        
        
            
                
                    hal-00788802
                                            v1 | |
| Selfish routing revisited: degeneracy, evolution and stochastic fluctuationsValueTools '11: ACM Proceedings of the 5th International Conference on Performance Evaluation Methodologies and Tools, 2011, Cargèse, France. pp.217-226Communication dans un congrès
                    
        
        
            
                
                    hal-00788801
                                            v1 | |
| Distribution of MIMO Mutual Information: a Large Deviations ApproachITW '09: Proceedings of the 2009 IEEE workshop on networking and information theory, 2009, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382308
                                            v1 | |
| Learning in the Presence of NoiseGameNets '09: Proceedings of the 1st International Conference on Game Theory for Networks, 2009, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382307
                                            v1 | |
| Vertical Handover Between Wireless Service ProvidersWiOpt '08: Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2008, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382309
                                            v1 | |
| Vertical Handover Between Wireless StandardsICC '08: Proceedings of the 2008 IEEE International Conference on Communications, 2008, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382310
                                            v1 | |
| The Simplex Game: Can Selfish Users Learn to Operate Efficiently in Wireless Networks?ValueTools '07: Proceedings of the 2nd International Conference on Performance Evaluation Methodologies and Tools, 2007, Unknown, Unknown RegionCommunication dans un congrès
                    
        
        
            
                
                    hal-01382312
                                            v1 | 
|  | Adaptive Power Allocation and Control in Time-Varying Multi-Carrier MIMO Networks2016Autre publication scientifique
                    
        
        
            
                
                    hal-01382289
                                            v1 | 
| Boltzmann meets Nash: Energy-efficient routing in optical networks under uncertainty2016Autre publication scientifique
                    
        
        
            
                
                    hal-01382287
                                            v1 | 
|  | On the discrete-time origins of the replicator dynamics: From convergence to instability and chaos2024Pré-publication, Document de travail
                    
        
        
            
                
                    hal-04629311
                                            v1 | 
|  | Explicit second-order min-max optimization methods with optimal convergence guarantees2024Pré-publication, Document de travail
                    
        
        
            
                
                    hal-03873989
                                            v1 | 
|  | On the rate of convergence of Bregman proximal methods in constrained variational inequalities2022Pré-publication, Document de travail
                    
        
        
            
                
                    hal-03873992
                                            v1 | 
|  | Online convex optimization and no-regret learning: Algorithms, guarantees and applications2018Pré-publication, Document de travail
                    
        
        
            
                
                    hal-01891562
                                            v1 | 
                Chargement...
            
            Chargement...