Pages that link to "Item:Q647486"
From MaRDI portal
The following pages link to Performance of one-round walks in linear congestion games (Q647486):
Displayed 8 items.
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- (Q5111703) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)