The following pages link to Michele Flammini (Q237650):
Displaying 50 items.
- Social context congestion games (Q386894) (← links)
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
- Network movement games (Q511922) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← 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)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Distance hedonic games (Q831802) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685) (← 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)
- On minimizing the number of ADMs in a general topology optical network (Q967313) (← links)
- Layouts for mobility management in wireless ATM networks (Q1003759) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- Simple, efficient routing schemes for all-optical networks (Q1293922) (← links)
- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions (Q1338785) (← links)
- On devising Boolean Routing Schemes (Q1389768) (← links)
- Deadlock prevention by acyclic orientations (Q1399106) (← links)
- Static and dynamic low-congested interval routing schemes (Q1605315) (← links)
- On the upper chromatic number of \((v_3,b_2)\)-configurations (Q1613359) (← links)
- Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games (Q1644952) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- (Q1816997) (redirect page) (← links)
- Experimental analysis of online algorithms for the bicriteria scheduling problem (Q1886378) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- How to survive while visiting a graph (Q1962049) (← links)
- Price of Pareto optimality in hedonic games (Q2046008) (← links)
- On fair price discrimination in multi-unit markets (Q2046039) (← links)
- Strategyproof mechanisms for friends and enemies games (Q2060745) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- On Pareto optimality in social distance games (Q2093365) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- On social envy-freeness in multi-unit markets (Q2321269) (← 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)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- Improved approximation results for the minimum energy broadcasting problem (Q2471706) (← links)
