Imagen de Portada

Learning generalized Nash equilibria from pairwise preferences

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Krupa, Pablo, Bemporad, Alberto
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Systems and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

NashOpt - A Python Library for Computing Generalized Nash Equilibria
por: Bemporad, Alberto
Publicado: (2025)

An asynchronous, forward-backward, distributed generalized Nash equilibrium seeking algorithm
por: Cenedese, Carlo, et al.
Publicado: (2019)

Higher-Order Uncoupled Learning Dynamics and Nash Equilibrium
por: Toonsi, Sarah A., et al.
Publicado: (2025)

Approximate solutions to games of ordered preference
por: Molins, Pau de las Heras, et al.
Publicado: (2025)

United We Fall: On the Nash Equilibria of Multiplex and Multilayer Network Games
por: Ebrahimi, Raman, et al.
Publicado: (2024)

Personalized incentives as feedback design in generalized Nash equilibrium problems
por: Fabiani, Filippo, et al.
Publicado: (2022)

Nash Equilibrium Learning In Large Populations With First-Order Payoff Modifications
por: Hankins, Matthew S., et al.
Publicado: (2025)

Strategic information disclosure with communication constraints and private preferences
por: Vasconcelos, Marcos M., et al.
Publicado: (2024)

Nash equilibria in scalar discrete-time linear quadratic games
por: Salizzoni, Giulio, et al.
Publicado: (2024)

Compression-based Privacy Preservation for Distributed Nash Equilibrium Seeking in Aggregative Games
por: Huo, Wei, et al.
Publicado: (2024)

Nash-equilibrium Seeking Algorithm for Power-Allocation Games on Networks of International Relations
por: Zhang, Chuanzhe, et al.
Publicado: (2025)

Communication-efficient and Differentially-private Distributed Nash Equilibrium Seeking with Linear Convergence
por: Chen, Xiaomeng, et al.
Publicado: (2024)

Inverse learning of black-box aggregator for robust Nash equilibrium
por: Chen, Guanpu, et al.
Publicado: (2024)

Distributionally Robust Nash Equilibrium Seeking with Partial Observations and Distributed Communication
por: Mandal, Nirabhra, et al.
Publicado: (2026)

More Information is Not Always Better: Connections between Zero-Sum Local Nash Equilibria in Feedback and Open-Loop Information Patterns
por: Gupta, Kushagra, et al.
Publicado: (2025)

Second-Order Algorithms for Finding Local Nash Equilibria in Zero-Sum Games
por: Gupta, Kushagra, et al.
Publicado: (2024)

Best-response algorithms for a class of monotone Nash equilibrium problems with mixed-integer variables
por: Fabiani, Filippo, et al.
Publicado: (2023)

Nash Soft Actor-Critic LEO Satellite Handover Management Algorithm for Flying Vehicles
por: Chen, Jinxuan, et al.
Publicado: (2024)

Evolutionary Games on Infinite Strategy Sets: Convergence to Nash Equilibria via Dissipativity
por: Anderson, Brendon G., et al.
Publicado: (2023)

Approximate Feedback Nash Equilibria with Sparse Inter-Agent Dependencies
por: Liu, Xinjie, et al.
Publicado: (2024)

Asymmetric Nash Seeking via Best Response Maps: Global Linear Convergence and Robustness to Inexact Reaction Models
por: Rabbani, Mahdis, et al.
Publicado: (2026)

Synchronization in Learning in Periodic Zero-Sum Games Triggers Divergence from Nash Equilibrium
por: Fujimoto, Yuma, et al.
Publicado: (2024)

Learning in Stackelberg Markov Games
por: He, Jun, et al.
Publicado: (2025)

Nash equilibria of quasisupermodular games
por: Yu, Lu
Publicado: (2024)

Nash Equilibrium and Learning Dynamics in Three-Player Matching $m$-Action Games
por: Fujimoto, Yuma, et al.
Publicado: (2024)

Incentive Analysis for Agent Participation in Federated Learning
por: Yi, Lihui, et al.
Publicado: (2025)

Rationality of Learning Algorithms in Repeated Normal-Form Games
por: Bajaj, Shivam, et al.
Publicado: (2024)

Learning and steering game dynamics towards desirable outcomes
por: Canyakmaz, Ilayda, et al.
Publicado: (2024)

Multi-Agent Learning in Contextual Games under Unknown Constraints
por: Maddux, Anna M., et al.
Publicado: (2023)

No-Regret Learning in Stackelberg Games with an Application to Electric Ride-Hailing
por: Maddux, Anna, et al.
Publicado: (2025)

Learning Optimal Stable Matches in Decentralized Markets with Unknown Preferences
por: Shah, Vade, et al.
Publicado: (2024)

Learning to Bid in Forward Electricity Markets Using a No-Regret Algorithm
por: Abate, Arega Getaneh, et al.
Publicado: (2024)

Memory Asymmetry Creates Heteroclinic Orbits to Nash Equilibrium in Learning in Zero-Sum Games
por: Fujimoto, Yuma, et al.
Publicado: (2023)

Learning with Episodic Hypothesis Testing in General Games: A Framework for Equilibrium Selection
por: Yang, Ruifan, et al.
Publicado: (2025)

On the tractability of Nash equilibrium
por: Avramopoulos, Ioannis
Publicado: (2023)

On Passivity, Reinforcement Learning and Higher-Order Learning in Multi-Agent Finite Games
por: Gao, Bolin, et al.
Publicado: (2018)

Optimal Evasion from a Sensing-Limited Pursuer
por: Maity, Dipankar, et al.
Publicado: (2024)

When Nash Meets Stackelberg
por: Carvalho, Margarida, et al.
Publicado: (2019)

Multi-Interval Energy-Reserve Co-Optimization with SoC-Dependent Bids from Battery Storage
por: Chen, Cong, et al.
Publicado: (2024)

Approximating Competitive Equilibrium by Nash Welfare
por: Garg, Jugal, et al.
Publicado: (2024)