The following pages link to (Q3549721):
Displayed 12 items.
- Generalized mirror descents in congestion games (Q334813) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Load balancing without regret in the bulletin board model (Q661046) (← links)
- Competitive routing over time (Q719282) (← links)
- FIFO and randomized competitive packet routing games (Q2085747) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions (Q2937761) (← links)
- On Learning Algorithms for Nash Equilibria (Q3162512) (← links)
- The Price of Stochastic Anarchy (Q5459995) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- Small-Loss Bounds for Online Learning with Partial Information (Q5868953) (← links)