中文
相关论文

相关论文: An existence theorem for single leader multi-follo…

200 篇论文

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

计算机科学与博弈论 · 计算机科学 2010-04-26 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

We study policy optimization in Stackelberg mean field games (MFGs), a hierarchical framework for modeling the strategic interaction between a single leader and an infinitely large population of homogeneous followers. The objective can be…

机器学习 · 计算机科学 2025-11-27 Sihan Zeng , Benjamin Patrick Evans , Sujay Bhatt , Leo Ardon , Sumitra Ganesh , Alec Koppel

Supermodular games find significant applications in a variety of models, especially in operations research and economic applications of noncooperative game theory, and feature pure strategy Nash equilibria characterized as fixed points of…

计算机科学与博弈论 · 计算机科学 2015-07-07 Francesco Ranzato

This paper studies two fundamental problems in regularized Graphon Mean-Field Games (GMFGs). First, we establish the existence of a Nash Equilibrium (NE) of any $\lambda$-regularized GMFG (for $\lambda\geq 0$). This result relies on weaker…

计算机科学与博弈论 · 计算机科学 2023-10-13 Fengzhuo Zhang , Vincent Y. F. Tan , Zhaoran Wang , Zhuoran Yang

Mobile data offloading is an emerging technology to avoid congestion in cellular networks and improve the level of user satisfaction. In this paper, we develop a distributed market framework to price the offloading service, and conduct a…

网络与互联网体系结构 · 计算机科学 2014-09-17 Kehao Wang , Francis C. M. Lau , Lin Chen , Robert Schober

The computational characterization of game-theoretic solution concepts is a central topic in artificial intelligence, with the aim of developing computationally efficient tools for finding optimal ways to behave in strategic interactions.…

计算机科学与博弈论 · 计算机科学 2013-04-05 Nicola Gatti , Marco Rocco , Tuomas Sandholm

This paper presents a general mean-field game (GMFG) framework for simultaneous learning and decision-making in stochastic games with a large population. It first establishes the existence of a unique Nash Equilibrium to this GMFG, and…

机器学习 · 计算机科学 2023-01-05 Xin Guo , Anran Hu , Renyuan Xu , Junzi Zhang

In this paper, we examine the Nash equilibrium convergence properties of no-regret learning in general N-player games. For concreteness, we focus on the archetypal follow the regularized leader (FTRL) family of algorithms, and we consider…

计算机科学与博弈论 · 计算机科学 2021-02-05 Angeliki Giannou , Emmanouil-Vasileios Vlatakis-Gkaragkounis , Panayotis Mertikopoulos

Nash equilibrium} (NE) can be stated as a formal theorem on a multilinear form, free of game theory terminology. On the other hand, inspired by this formalism, we state and prove a {\it multilinear minimax theorem}, a generalization of von…

计算机科学与博弈论 · 计算机科学 2024-01-01 Bahman Kalantari

We study incentive designs for a class of stochastic Stackelberg games with one leader and a large number of (finite as well as infinite population of) followers. We investigate whether the leader can craft a strategy under a dynamic…

计算机科学与博弈论 · 计算机科学 2024-02-13 Sina Sanjari , Subhonmesh Bose , Tamer Başar

We introduce a class of finite strategic games with the property that every deviation of a coalition of players that is profitable to each of its members strictly decreases the lexicographical order of a certain function defined on the set…

计算机科学与博弈论 · 计算机科学 2009-09-03 Tobias Harks , Max Klimm , Rolf H. Moehring

The mean field games (MFG) paradigm was introduced to provide tractable approximations of games involving very large populations. The theory typically rests on two key assumptions: homogeneity, meaning that all players share the same…

最优化与控制 · 数学 2025-11-10 Mathieu Laurière

We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a…

计算机科学与博弈论 · 计算机科学 2013-07-19 G. Gottlob , G. Greco , F. Scarcello

The symmetric generalized eigenvalue problem (SGEP) is a fundamental concept in numerical linear algebra. It captures the solution of many classical machine learning problems such as canonical correlation analysis, independent components…

机器学习 · 计算机科学 2023-04-26 Ian Gemp , Charlie Chen , Brian McWilliams

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…

计算机科学与博弈论 · 计算机科学 2026-05-11 Ian Gemp , Crystal Qian , Marc Lanctot , Kate Larson

We study the problem of finding Stackelberg equilibria in games with a massive number of players. So far, the only known game instances in which the problem is solved in polynomial time are some particular congestion games. However, a…

计算机科学与博弈论 · 计算机科学 2019-05-31 Alberto Marchesi , Matteo Castiglioni , Nicola Gatti

This paper studies open-loop and feedback solutions to leader-follower mean field linear-quadratic-Gaussian games with multiplicative noise by the direct approach. The leader-follower game involves a leader and many followers, where the…

最优化与控制 · 数学 2025-12-04 Bing-Chang Wang , Huanshui Zhang , Ji-Feng Zhang

In this paper, we consider stochastic monotone Nash games where each player's strategy set is characterized by possibly a large number of explicit convex constraint inequalities. Notably, the functional constraints of each player may depend…

最优化与控制 · 数学 2023-08-25 Zeinab Alizadeh , Afrooz Jalilzadeh , Farzad Yousefian

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

计算机科学与博弈论 · 计算机科学 2013-08-01 Leslie Ann Goldberg , Paul W. Goldberg , Piotr Krysta , Carmine Ventre

Recently, Apt and Markakis introduced a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives (products). To analyze these networks…

计算机科学与博弈论 · 计算机科学 2013-07-18 Krzysztof R. Apt , Sunil Simon