Angelo Fanelli

Orcid: 0000-0002-4896-6889

Affiliations:
  • CNRS (Centre National de la Recherche Scientifique), France


According to our database1, Angelo Fanelli authored at least 43 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Minimizing Rosenthal's Potential in Monotone Congestion Games.
CoRR, 2024

Individually Stable Dynamics in Coalition Formation over Graphs.
CoRR, 2024

2021
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies.
J. Comput. Syst. Sci., 2021

Relaxed Core Stability in Fractional Hedonic Games.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Local Aggregation in Preference Games.
CoRR, 2020

Price of Pareto Optimality in hedonic games.
Artif. Intell., 2020

2019
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling.
Theory Comput. Syst., 2019

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Consensus in Opinion Formation Processes in Fully Evolving Environments.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Opinion formation games with dynamic social influences.
Theor. Comput. Sci., 2018

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation.
J. Artif. Intell. Res., 2018

2017
On lookahead equilibria in congestion games.
Math. Struct. Comput. Sci., 2017

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

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
The price of envy-freeness in machine scheduling.
Theor. Comput. Sci., 2016

Ride Sharing with a Vehicle of Unlimited Capacity.
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.
ACM Trans. Economics and Comput., 2015

The ring design game with fair cost allocation.
Theor. Comput. Sci., 2015

Dynamics of Profit-Sharing Games.
Internet Math., 2015

Enforcing Efficient Equilibria in Network Design Games via Subsidies.
Algorithmica, 2015

On the Price of Stability of Fractional Hedonic Games.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Nash Stability in Fractional Hedonic Games.
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.
Theory Comput. Syst., 2013

Stackelberg Strategies for Network Design Games.
Internet Math., 2013

2012
The speed of convergence in congestion games under best-response dynamics.
ACM Trans. Algorithms, 2012

Computing approximate pure Nash equilibria in congestion games.
SIGecom Exch., 2012

The Ring Design Game with Fair Cost Allocation - [Extended Abstract].
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

On the Impact of Fair Best Response Dynamics.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Performance of One-Round Walks in Linear Congestion Games.
Theory Comput. Syst., 2011

Experimental Evaluations of Algorithms for IP Table Minimization.
J. Interconnect. Networks, 2011

On best response dynamics in weighted congestion games with polynomial delays.
Distributed Comput., 2011

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

Efficient computation of approximate pure Nash equilibria
CoRR, 2011

Graphical Congestion Games.
Algorithmica, 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
When ignorance helps: Graphical multicast cost sharing games.
Theor. Comput. Sci., 2010

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.
Theory Comput. Syst., 2010

On the Convergence of Multicast Games in Directed Networks.
Algorithmica, 2010

Computing Exact and Approximate Nash Equilibria in 2-Player Games.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

Game-Theoretic Approaches to Optimization Problems in Communication Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Performances of One-Round Walks in Linear Congestion Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008
Graphical congestion games with linear latencies.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2006
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006


  Loading...