The following pages link to Gianpiero Monaco (Q436819):
Displayed 46 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- The ring design game with fair cost allocation (Q476847) (← 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)
- 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)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- Selfishness, collusion and power of local search for the ADMs minimization problem (Q931111) (← links)
- Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games (Q1644952) (← links)
- On colorful bin packing games (Q1790984) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Selfish colorful bin packing games (Q2023116) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Coalition resilient outcomes in max \(k\)-cut games (Q2206218) (← links)
- Some anomalies of farsighted strategic behavior (Q2344212) (← 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)
- Additively separable hedonic games with social context (Q2669108) (← links)
- Nash social welfare in selfish and online load balancing (Q2692293) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- Some Anomalies of Farsighted Strategic Behavior (Q2848928) (← links)
- The Price of Envy-Freeness in Machine Scheduling (Q2922600) (← links)
- Nash Stability in Fractional Hedonic Games (Q2937016) (← 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)
- 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)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation (Q4580266) (← links)
- Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games (Q4989321) (← links)
- (Q5005131) (← links)
- (Q5005149) (← links)
- On the Online Coalition Structure Generation Problem (Q5026232) (← links)
- Pricing Problems with Buyer Preselection (Q5043562) (← links)
- (Q5090386) (← links)
- (Q5111457) (← links)
- On the Performances of Nash Equilibria in Isolation Games (Q5323044) (← links)
- Generalized graph \(k\)-coloring games (Q5916253) (← links)
- Generalized graph \(k\)-coloring games (Q5918905) (← links)
- Budget feasible mechanisms on matroids (Q5920068) (← links)
- Budget feasible mechanisms on matroids (Q5925520) (← links)