Gianpiero Monaco

Available identifiers

zbMath Open monaco.gianpieroMaRDI QIDQ436819

List of research outcomes

Publication	Date of Publication	Type
The multi-budget maximum weighted coverage problem	2023-03-22	Paper
Nash social welfare in selfish and online load balancing	2023-03-21	Paper
Pricing Problems with Buyer Preselection	2022-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q5090386	2022-07-18	Paper
Additively separable hedonic games with social context	2022-03-09	Paper
Almost envy-free allocations with connected bundles	2022-02-25	Paper
On the Online Coalition Structure Generation Problem	2022-02-07	Paper
Generalized budgeted submodular set function maximization	2021-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q5005131	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5005149	2021-08-04	Paper
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games	2021-05-25	Paper
Selfish colorful bin packing games	2021-05-03	Paper
Budget feasible mechanisms on matroids	2021-04-19	Paper
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions	2021-03-12	Paper
Coalition resilient outcomes in max \(k\)-cut games	2020-10-22	Paper
Generalized graph \(k\)-coloring games	2020-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q5111457	2020-05-27	Paper
On colorful bin packing games	2018-10-04	Paper
Generalized graph \(k\)-coloring games	2018-10-04	Paper
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation	2018-08-14	Paper
Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games	2018-06-22	Paper
Budget feasible mechanisms on matroids	2017-08-31	Paper
On the complexity of the regenerator cost problem in general networks with traffic grooming	2017-05-17	Paper
Network movement games	2017-02-22	Paper
Approximating the revenue maximization problem with sharp demands	2017-01-09	Paper
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions	2016-01-08	Paper
The price of envy-freeness in machine scheduling	2015-12-28	Paper
Some anomalies of farsighted strategic behavior	2015-05-12	Paper
Nash Stability in Fractional Hedonic Games	2015-01-07	Paper
The ring design game with fair cost allocation	2014-12-02	Paper
The Price of Envy-Freeness in Machine Scheduling	2014-10-14	Paper
Approximating the Revenue Maximization Problem with Sharp Demands	2014-09-02	Paper
Some Anomalies of Farsighted Strategic Behavior	2013-09-13	Paper
Improved lower bounds on the price of stability of undirected network design games	2013-08-01	Paper
A 6/5-approximation algorithm for the maximum 3-cover problem	2013-04-08	Paper
Approximating the traffic grooming problem in tree and star networks	2012-07-26	Paper
Optimizing regenerator cost in traffic grooming	2012-01-04	Paper
On the performances of Nash equilibria in isolation games	2011-12-15	Paper
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games	2010-10-19	Paper
Minimizing total busy time in parallel scheduling with application to optical networks	2010-10-11	Paper
Traffic Grooming: Combinatorial Results and Practical Resolutions	2010-02-09	Paper
Game-Theoretic Approaches to Optimization Problems in Communication Networks	2010-02-09	Paper
On the Performances of Nash Equilibria in Isolation Games	2009-07-23	Paper
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem	2009-02-03	Paper
Approximating the Traffic Grooming Problem in Tree and Star Networks	2008-09-04	Paper
Selfishness, collusion and power of local search for the ADMs minimization problem	2008-06-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Gianpiero Monaco