Search Results for author:
Found 5 papers, 3 papers with code
Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots
To solve the problem, we introduce Branch and Play (B&P), an efficient and exact algorithm that provably converges to a socially optimal order of play and its Stackelberg equilibrium.
Differentiable Cutting-plane Layers for Mixed-integer Linear Optimization
We consider the problem of solving a family of parametric mixed-integer linear optimization problems where some entries in the input data change.
When Nash Meets Stackelberg
This article introduces a class of $Nash$ games among $Stackelberg$ players ($NASPs$), namely, a class of simultaneous non-cooperative games where the players solve sequential Stackelberg games.
Computer Science and Game Theory Optimization and Control
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
The Oberwolfach Problem $OP(F)$, posed by Gerhard Ringel in 1967, is a paradigmatic Combinatorial Design problem asking whether the complete graph $K_v$ decomposes into edge-disjoint copies of a $2$-regular graph $F$ of order $v$.
Combinatorics
Introducing Fairness and Diversification in WTA and ATP Tennis Tournaments Generation
Besides, the distribution of pairings in the first round between unseeded players and seeds for a yearly season may be strongly unbalanced.
Physics and Society Combinatorics Optimization and Control
