Pages that link to "Item:Q2568459"
From MaRDI portal
The following pages link to Efficient algorithms for online decision problems (Q2568459):
Displaying 14 items.
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- Near-Optimal Algorithms for Online Matrix Prediction (Q5737809) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths (Q5855701) (← links)
- Small-Loss Bounds for Online Learning with Partial Information (Q5868953) (← links)
- No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
- No-regret learning for repeated non-cooperative games with lossy bandits (Q6152576) (← links)
- Synthetic control as online linear regression (Q6536522) (← links)
- Regret analysis of an online majorized semi-proximal ADMM for online composite optimization (Q6568953) (← links)
- Online dynamic submodular optimization (Q6585408) (← links)
- Multiagent learning for competitive opinion optimization (Q6614028) (← links)
- Efficient algorithms for implementing incremental proximal-point methods (Q6645949) (← links)
- An \(\alpha \)-regret analysis of adversarial bilateral trade (Q6665707) (← links)