Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Computing a pessimistic stackelberg equilibrium with multiple followers: The mixed-pure case
The search problem of computing a Stackelberg (or leader-follower) equilibrium (also
referred to as an optimal strategy to commit to) has been widely investigated in the scientific …
referred to as an optimal strategy to commit to) has been widely investigated in the scientific …
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
The concept of leader-follower (or Stackelberg) equilibrium plays a central role in a number
of real-world applications bordering on mathematical optimization and game theory. While …
of real-world applications bordering on mathematical optimization and game theory. While …
A unified framework for multistage mixed integer linear optimization
We introduce a unified framework for the study of multilevel mixed integer linear optimization
problems and multistage stochastic mixed integer linear optimization problems with …
problems and multistage stochastic mixed integer linear optimization problems with …
Committing to correlated strategies with multiple leaders
We address multi-agent Stackelberg settings involving many leaders and followers. In order
to effectively model this kind of interactions, we extend the idea of commitment to correlated …
to effectively model this kind of interactions, we extend the idea of commitment to correlated …
[HTML][HTML] Monotonicity of equilibria in nonatomic congestion games
This paper studies the monotonicity of equilibrium costs and equilibrium loads in nonatomic
congestion games, in response to variations of the demands. The main goal is to identify …
congestion games, in response to variations of the demands. The main goal is to identify …
[PDF][PDF] Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions.
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 …
players. So far, the only known game instances in which the problem is solved in polynomial …
Fighting for routes: Resource allocation among competing planners in transportation networks
In transportation networks, incomplete information is ubiquitous, and users often delegate
their route choice to distributed route planners. To model and study these systems, we …
their route choice to distributed route planners. To model and study these systems, we …
Multi-leader congestion games with an adversary
We study a multi-leader single-follower congestion game where multiple users (leaders)
choose one resource out of a set of resources and, after observing the realized loads, an …
choose one resource out of a set of resources and, after observing the realized loads, an …
Classification under strategic adversary manipulation using pessimistic bilevel optimisation
Adversarial machine learning concerns situations in which learners face attacks from active
adversaries. Such scenarios arise in applications such as spam email filtering, malware …
adversaries. Such scenarios arise in applications such as spam email filtering, malware …
[HTML][HTML] Increasing revenue in Bayesian posted price auctions through signaling
We study single-item single-unit Bayesian posted price auctions, where buyers arrive
sequentially and their valuations for the item being sold depend on a random, unknown …
sequentially and their valuations for the item being sold depend on a random, unknown …