Vittorio Bilò

Gianpiero Monaco

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions.

[BibT_eX]

[DOI]

Distributed Comput., 2021

On Nash Equilibria in Non-Cooperative All-Optical Networks.

[BibT_eX]

[DOI]

Algorithms, 2021

The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

The price of anarchy of affine congestion games with similar strategies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Selfish colorful bin packing games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

The price of stability for undirected broadcast network design with fair cost allocation is constant.

[BibT_eX]

[DOI]

Games Econ. Behav., 2020

On Multidimensional Congestion Games.

[BibT_eX]

[DOI]

Algorithms, 2020

Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

The Quality of Content Publishing in the Digital Era.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

Dynamic Taxes for Polynomial Congestion Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

Editorial.

[BibT_eX]

[DOI]

Antonio Caruso

Theor. Comput. Sci., 2019

On Stackelberg Strategies in Affine Congestion Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Guest Editorial: Special Issue on Algorithmic Game Theory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

On a Simple Hedonic Game with Graph-Restricted Communication.

[BibT_eX]

[DOI]

Laurent Gourvès

Jérôme Monnot

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Opinion formation games with dynamic social influences.

[BibT_eX]

[DOI]

Angelo Fanelli

Theor. Comput. Sci., 2018

A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

On Colorful Bin Packing Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

On the Impact of Buyers Preselection in Pricing Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Approximating the revenue maximization problem with sharp demands.

[BibT_eX]

[DOI]

Gianpiero Monaco

Theor. Comput. Sci., 2017

On lookahead equilibria in congestion games.

[BibT_eX]

[DOI]

Angelo Fanelli

Math. Struct. Comput. Sci., 2017

Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Impact of Singleton Strategies in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

The price of envy-freeness in machine scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the performance of mildly greedy players in cut games.

[BibT_eX]

[DOI]

Mauro Paladini

J. Comb. Optim., 2016

A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Some Anomalies of Farsighted Strategic Behavior.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

New bounds for the balloon popping problem.

[BibT_eX]

[DOI]

Davide Bilò

J. Comb. Optim., 2015

On the sequential price of anarchy of isolation games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

On the Price of Stability of Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Complexity of Rational and Irrational Nash Equilibria.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Nash Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

On the Stackelberg fuel pricing problem.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

On Linear Congestion Games with Altruistic Social Context.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Social context congestion games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

The price of stability of fair undirected broadcast games is constant.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

2012

On Bidimensional Congestion Games.

[BibT_eX]

[DOI]

Vasco Gallotti

Proceedings of the Structural Information and Communication Complexity, 2012

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

2011

Extending the notion of rationality of selfish agents: Second Order Nash equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Performance of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Bounds on the Price of stability of Undirected Network Design Games with Three Players.

[BibT_eX]

[DOI]

Roberta Bove

J. Interconnect. Networks, 2011

On the performances of Nash equilibria in isolation games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Graphical Congestion Games.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

When ignorance helps: Graphical multicast cost sharing games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

The Price of Nash Equilibria in Multicast Transmission Games.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2010

One-round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Bull. EATCS, 2010

Computing Exact and Approximate Nash Equilibria in 2-Player Games.

[BibT_eX]

[DOI]

Angelo Fanelli

Proceedings of the Algorithmic Aspects in Information and Management, 2010

Game-Theoretic Approaches to Optimization Problems in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Performances of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008

On Nash equilibria for multicast transmissions in ad-hoc wireless networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

Graphical congestion games with linear latencies.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007

The Price of Nash Equilibria in Multicast Transmissions Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

On Satisfiability Games and the Power of Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Pareto approximations for the bicriteria scheduling problem.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

On the packing of selfish items.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

Pricing and equilibria in non-cooperative networks.

[BibT_eX]

[DOI]

PhD thesis, 2005

Geometric Clustering to Minimize the Sum of Cluster Sizes.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

Proceedings of the Algorithms, 2005

2004

Experimental analysis of online algorithms for the bicriteria scheduling problem.

[BibT_eX]

[DOI]

Roberto Giovannelli

J. Parallel Distributed Comput., 2004

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Chiara Di Francescomarino

Giovanna Melideo

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

The Price of Anarchy in All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

On the IP Routing Tables Minimization with Addresses Reassignment.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph.

[BibT_eX]

[DOI]