The following pages link to Luca Moscardelli (Q436820):
Displaying 50 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- (Q511921) (redirect page) (← links)
- Network movement games (Q511922) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Graphical congestion games (Q639291) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- On the performances of Nash equilibria in isolation games (Q652635) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- Asymptotically optimal solutions for small world graphs (Q927399) (← links)
- Selfishness, collusion and power of local search for the ADMs minimization problem (Q931111) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- Opinion formation games with dynamic social influences (Q1784744) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- Some anomalies of farsighted strategic behavior (Q2344212) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- Pareto approximations for the bicriteria scheduling problem (Q2369687) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- Additively separable hedonic games with social context (Q2669108) (← links)
- Nash social welfare in selfish and online load balancing (Q2692293) (← links)
- Stackelberg Strategies for Network Design Games (Q2808832) (← links)
- Some Anomalies of Farsighted Strategic Behavior (Q2848928) (← links)
- On the Impact of Fair Best Response Dynamics (Q2912735) (← links)
- The Price of Envy-Freeness in Machine Scheduling (Q2922600) (← links)
- Nash Stability in Fractional Hedonic Games (Q2937016) (← links)
- On Lookahead Equilibria in Congestion Games (Q2937746) (← links)
- Opinion Formation Games with Dynamic Social Influences (Q2959850) (← links)
- On lookahead equilibria in congestion games (Q2971063) (← links)
- The speed of convergence in congestion games under best-response dynamics (Q3189066) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Game-Theoretic Approaches to Optimization Problems in Communication Networks (Q3404472) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
- The Speed of Convergence in Congestion Games under Best-Response Dynamics (Q3521967) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- When Ignorance Helps: Graphical Multicast Cost Sharing Games (Q3599119) (← links)
- Tight Bounds for Selfish and Greedy Load Balancing (Q3613769) (← links)
- Performances of One-Round Walks in Linear Congestion Games (Q3648866) (← links)
- Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation (Q4580266) (← links)
- On the Sequential Price of Anarchy of Isolation Games (Q4925222) (← links)
- (Q4967158) (← links)
- (Q5002835) (← links)
- (Q5005149) (← links)
- On the Online Coalition Structure Generation Problem (Q5026232) (← links)
