6 problems

BPR boundary conjecture. The boundaries between the regions $$ are asymptotic to straight lines through the origin.

The decision variable $\mathbf{S}$ is binary, with $\mathbf{S} \in \{0,1\}^{(|\mathcal{R}||\mathcal{I}|) \times |\mathcal{N}|}$, and the optimization problem is the problem defined…

Vanishing-weight composite-game conjecture. In the vanishing-weight limit, the game may converge to a composite game with coexistence of atomic-splittable and nonatomic players.

Consider routings in the set of BANE, in a network with altruistic autonomous users, and let the equilibrium roads be the roads used at equilibrium. BANE minimum-equilibrium-roads…

Brun et al.'s geometric convergence conjecture. The best-response dynamics may converge geometrically under, including for more than two players.

Seasonality upper-bound conjecture. Based on numerical examples, $D(\boldsymbol{\delta})$ is always an upper bound for the extra equilibrium cost due to seasonality.