Angelo Fanelli

Gianpiero Monaco

Artif. Intell., 2025

Minimizing Rosenthal's Potential in Monotone Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Individually Stable Dynamics in Coalition Formation over Graphs.

[BibT_eX]

[DOI]

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2022

Relaxed Core Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Gianpiero Monaco

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2020

Local Aggregation in Preference Games.

[BibT_eX]

[DOI]

Dimitris Fotakis

CoRR, 2020

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

On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Consensus in Opinion Formation Processes in Fully Evolving Environments.

[BibT_eX]

[DOI]

Vincenzo Auletta

Diodato Ferraioli

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

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

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.

[BibT_eX]

[DOI]

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

2016

Opinion Formation Games with Dynamic Social Influences.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Ride Sharing with a Vehicle of Unlimited Capacity.

[BibT_eX]

[DOI]

Gianluigi Greco

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Price of Pareto Optimality in Hedonic Games.

[BibT_eX]

[DOI]

Edith Elkind

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

The ring design game with fair cost allocation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Nash Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

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

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Nick Gravin

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

The Price of Envy-Freeness in Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

On Lookahead Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Computing approximate pure Nash equilibria in congestion games.

[BibT_eX]

[DOI]

SIGecom Exch., 2012

The Ring Design Game with Fair Cost Allocation - [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Enforcing efficient equilibria in network design games via subsidies.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

On the Impact of Fair Best Response Dynamics.

[BibT_eX]

[DOI]

Alexander Skopalik

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Performance of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions

[BibT_eX]

[DOI]

CoRR, 2011

Efficient computation of approximate pure Nash equilibria

[BibT_eX]

[DOI]

CoRR, 2011

Dynamics of Profit-Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Stackelberg Strategies for Network Design Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

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

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

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

[BibT_eX]

[DOI]

Vittorio Bilò

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

On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Performances of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

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

2008

Graphical Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 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

When Ignorance Helps: Graphical Multicast Cost Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

The Speed of Convergence in Congestion Games under Best-Response Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Experimental Evaluations of Algorithms for IP Table Minimization.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

On the convergence of multicast games in directed networks.

[BibT_eX]

[DOI]