The following pages link to Vittorio Bilò (Q346479):
Displaying 50 items.
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Social context congestion games (Q386894) (← links)
- Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Graphical congestion games (Q639291) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- On the performances of Nash equilibria in isolation games (Q652635) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← 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)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Opinion formation games with dynamic social influences (Q1784744) (← links)
- On colorful bin packing games (Q1790984) (← links)
- Experimental analysis of online algorithms for the bicriteria scheduling problem (Q1886378) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Selfish colorful bin packing games (Q2023116) (← links)
- On the robustness of the approximate price of anarchy in generalized congestion games (Q2077399) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Congestion games with priority-based scheduling (Q2109948) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- On a simple hedonic game with graph-restricted communication (Q2292629) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Some anomalies of farsighted strategic behavior (Q2344212) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- New bounds for the balloon popping problem (Q2354305) (← links)
- Pareto approximations for the bicriteria scheduling problem (Q2369687) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← 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 the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games (Q2819450) (← links)
- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games (Q2848927) (← links)
- Some Anomalies of Farsighted Strategic Behavior (Q2848928) (← links)
- On the Performance of Mildly Greedy Players in Cut Games (Q2920486) (← links)
- On Linear Congestion Games with Altruistic Social Context (Q2920491) (← 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)
- (Q3059186) (← links)
- Complexity of Rational and Irrational Nash Equilibria (Q3095274) (← links)
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
- Approximating the Revenue Maximization Problem with Sharp Demands (Q3188883) (← 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)
- On Stackelberg Strategies in Affine Congestion Games (Q3460782) (← links)
