The following pages link to Cosimo Vinci (Q1731511):
Displaying 16 items.
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Congestion games with priority-based scheduling (Q2109948) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Data-driven models of selfish routing: why price of anarchy does depend on network topology (Q2692285) (← links)
- Nash social welfare in selfish and online load balancing (Q2692293) (← links)
- On Stackelberg Strategies in Affine Congestion Games (Q3460782) (← links)
- Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling (Q4614059) (← links)
- (Q4999208) (← links)
- (Q5002835) (← links)
- (Q5090386) (← links)
- (Q5111703) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)
- Uniform Mixed Equilibria in Network Congestion Games with Link Failures (Q6149404) (← links)
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback (Q6161475) (← links)