8 problems
- 0 votes0 replies1 view
Bellman strategy's utility advantage against straightforward bidding
Let be a time, let be the history at time , and let and denote the expected utilities when the foc…
- 0 votes0 replies0 views
Giannakopoulos–Koutsoupias conjecture on the optimality of the straight-jacket auction
Giannakopoulos–Koutsoupias conjecture. The straight-jacket auction is optimal for this auction problem.
- 0 votes0 replies0 views
The affine-demand convergence conjecture for Nash equilibria
Consider the pay-as-bid supply-function game with the strategy space restricted to -Lipschitz supply functions, and suppose that the demand is affine. The affine-demand converge…
- 0 votes0 replies0 views
The piecewise supermodularity conjecture for linear-demand supply-function games
Consider the restricted game in which each agent's strategy is parametrized by a single parameter , and suppose that the demand is linear. The piecewise supermodularity conjec…
- 0 votes0 replies0 views
The infinite-slope conjecture for pay-as-bid auction equilibria
Let be the Lipschitz constant defining the strategy space of supply functions, and let the equilibrium outcome be the resulting Nash equilibrium outcome of the pay-as-bid aucti…
- 0 votes0 replies1 view
Conjecture that the revenue-maximizing equilibrium is unique in general
General uniqueness conjecture. is the unique equilibrium for fewer bidders under a non-informative information structure, regardless of the specific parameters of the au…
- 0 votes0 replies1 view
Conjecture that non-informative information yields uniqueness with fewer bidders
Uniqueness conjecture. Fewer bidders are required for to be the unique equilibrium when the information structure is non-informative than when it is informative.
- 0 votes0 replies0 views
Revenue superiority conjecture for pure bundle auctions
Revenue superiority conjecture. A revenue-maximizing potential helper prefers the pure bundle auction over both separate single-object subcarrier auctions and the naive multiple-ob…