Angelo Fanelli

Gianpiero Monaco

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

2021

On approximate pure Nash equilibria in weighted congestion games with polynomial latencies.

[BibT_eX]

[DOI]

Ioannis Caragiannis

J. Comput. Syst. Sci., 2021

2020

Local Aggregation in Preference Games.

[BibT_eX]

[DOI]

Dimitris Fotakis

CoRR, 2020

Price of Pareto Optimality in hedonic games.

[BibT_eX]

[DOI]

Edith Elkind

Artif. Intell., 2020

2019

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Theory Comput. Syst., 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

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

Opinion formation games with dynamic social influences.

[BibT_eX]

[DOI]

Vittorio Bilò

Theor. Comput. Sci., 2018

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

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

2017

On lookahead equilibria in congestion games.

[BibT_eX]

[DOI]

Vittorio Bilò

Math. Struct. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

Ioannis Caragiannis

Nick Gravin

Algorithmica, 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

The price of envy-freeness in machine scheduling.

[BibT_eX]

[DOI]

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

2015

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

The ring design game with fair cost allocation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Dynamics of Profit-Sharing Games.

[BibT_eX]

[DOI]

Internet Math., 2015

Enforcing Efficient Equilibria in Network Design Games via Subsidies.

[BibT_eX]

[DOI]

Algorithmica, 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

2013

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Stackelberg Strategies for Network Design Games.

[BibT_eX]

[DOI]

Internet Math., 2013

2012

The speed of convergence in congestion games under best-response dynamics.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 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

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

Experimental Evaluations of Algorithms for IP Table Minimization.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2011

On best response dynamics in weighted congestion games with polynomial delays.

[BibT_eX]

[DOI]

Distributed Comput., 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

Graphical Congestion Games.

[BibT_eX]

[DOI]

Algorithmica, 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

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

On the Convergence of Multicast Games in Directed Networks.

[BibT_eX]

[DOI]

Algorithmica, 2010

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

[BibT_eX]

[DOI]

Vittorio Bilò