The following pages link to Angelo Fanelli (Q476845):
Displaying 36 items.
- The ring design game with fair cost allocation (Q476847) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Graphical congestion games (Q639291) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- Opinion formation games with dynamic social influences (Q1784744) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Price of Pareto optimality in hedonic games (Q2046008) (← links)
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies (Q2221800) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)
- Stackelberg Strategies for Network Design Games (Q2808832) (← 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)
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
- The speed of convergence in congestion games under best-response dynamics (Q3189066) (← links)
- Game-Theoretic Approaches to Optimization Problems in Communication Networks (Q3404472) (← links)
- The Speed of Convergence in Congestion Games under Best-Response Dynamics (Q3521967) (← links)
- Computing Exact and Approximate Nash Equilibria in 2-Player Games (Q3578358) (← links)
- When Ignorance Helps: Graphical Multicast Cost Sharing Games (Q3599119) (← 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)
- Ride Sharing with a Vehicle of Unlimited Capacity. (Q4608596) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies (Q5092336) (← links)
- Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems (Q5111457) (← links)
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games (Q5495031) (← links)
- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves (Q5756673) (← links)
