default search action
Angelo Fanelli 0001
Person information
- affiliation: CNRS (Centre National de la Recherche Scientifique), France
Other persons with the same name
- Angelo Fanelli 0002 — HEC School of Management, Jouy-en-Josas, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi, Luca Moscardelli:
Individually Stable Dynamics in Coalition Formation over Graphs. CoRR abs/2408.11488 (2024) - [i11]Vittorio Bilò, Angelo Fanelli, Laurent Gourvès, Christos Tsoufis, Cosimo Vinci:
Minimizing Rosenthal's Potential in Monotone Congestion Games. CoRR abs/2408.11489 (2024) - 2022
- [c33]Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli:
Relaxed Core Stability in Fractional Hedonic Games. ISAIM 2022 - 2021
- [j23]Ioannis Caragiannis, Angelo Fanelli:
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. J. Comput. Syst. Sci. 117: 40-48 (2021) - [c32]Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli:
Relaxed Core Stability in Fractional Hedonic Games. IJCAI 2021: 182-188 - 2020
- [j22]Edith Elkind, Angelo Fanelli, Michele Flammini:
Price of Pareto Optimality in hedonic games. Artif. Intell. 288: 103357 (2020) - [i10]Angelo Fanelli, Dimitris Fotakis:
Local Aggregation in Preference Games. CoRR abs/2002.01251 (2020)
2010 – 2019
- 2019
- [j21]Ioannis Caragiannis
, Angelo Fanelli
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. Theory Comput. Syst. 63(1): 114-127 (2019) - [c31]Vincenzo Auletta, Angelo Fanelli, Diodato Ferraioli:
Consensus in Opinion Formation Processes in Fully Evolving Environments. AAAI 2019: 6022-6029 - [c30]Ioannis Caragiannis, Angelo Fanelli
On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies. ICALP 2019: 133:1-133:12 - [c29]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI 2019: 102-108 - [i9]Ioannis Caragiannis, Angelo Fanelli:
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. CoRR abs/1902.07173 (2019) - 2018
- [j20]Vittorio Bilò
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. J. Artif. Intell. Res. 62: 315-371 (2018) - [j19]Vittorio Bilò
Opinion formation games with dynamic social influences. Theor. Comput. Sci. 746: 73-87 (2018) - 2017
- [j18]Ioannis Caragiannis, Angelo Fanelli
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. Algorithmica 77(4): 1143-1158 (2017) - [j17]Vittorio Bilò
On lookahead equilibria in congestion games. Math. Struct. Comput. Sci. 27(2): 197-214 (2017) - [c28]Vittorio Bilò
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP 2017: 125:1-125:13 - 2016
- [j16]Vittorio Bilò
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613: 65-78 (2016) - [c27]Edith Elkind, Angelo Fanelli, Michele Flammini:
Price of Pareto Optimality in Hedonic Games. AAAI 2016: 475-481 - [c26]Angelo Fanelli
Ride Sharing with a Vehicle of Unlimited Capacity. MFCS 2016: 36:1-36:14 - [c25]Ioannis Caragiannis, Angelo Fanelli
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. SAGT 2016: 315-326 - [c24]Vittorio Bilò
Opinion Formation Games with Dynamic Social Influences. WINE 2016: 444-458 - [i8]Ioannis Caragiannis, Angelo Fanelli:
An almost ideal coordination mechanism for unrelated machine scheduling. CoRR abs/1605.04674 (2016) - 2015
- [j15]John Augustine, Ioannis Caragiannis
Enforcing Efficient Equilibria in Network Design Games via Subsidies. Algorithmica 72(1): 44-82 (2015) - [j14]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli
Dynamics of Profit-Sharing Games. Internet Math. 11(1): 1-22 (2015) - [j13]Angelo Fanelli
The ring design game with fair cost allocation. Theor. Comput. Sci. 562: 90-100 (2015) - [j12]Ioannis Caragiannis, Angelo Fanelli
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. ACM Trans. Economics and Comput. 3(1): 2:1-2:32 (2015) - [c23]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Price of Stability of Fractional Hedonic Games. AAMAS 2015: 1239-1247 - [i7]Angelo Fanelli, Gianluigi Greco:
Ride Sharing with a Vehicle of Unlimited Capacity. CoRR abs/1507.02414 (2015) - 2014
- [c22]Vittorio Bilò
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) 2014: 106-117 - [c21]Ioannis Caragiannis, Angelo Fanelli
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. SAGT 2014: 49-60 - [c20]Vittorio Bilò
Nash Stability in Fractional Hedonic Games. WINE 2014: 486-491 - [i6]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. CoRR abs/1402.3450 (2014) - 2013
- [j11]Angelo Fanelli
Stackelberg Strategies for Network Design Games. Internet Math. 9(4): 336-359 (2013) - [j10]Vittorio Bilò
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Theory Comput. Syst. 52(4): 668-686 (2013) - [c19]Vittorio Bilò
On Lookahead Equilibria in Congestion Games. WINE 2013: 54-67 - 2012
- [j9]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Computing approximate pure Nash equilibria in congestion games. SIGecom Exch. 11(1): 26-29 (2012) - [j8]Angelo Fanelli
The speed of convergence in congestion games under best-response dynamics. ACM Trans. Algorithms 8(3): 25:1-25:15 (2012) - [c18]Angelo Fanelli
On the Impact of Fair Best Response Dynamics. MFCS 2012: 360-371 - [c17]Ioannis Caragiannis
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. EC 2012: 284-301 - [c16]John Augustine, Ioannis Caragiannis
Enforcing efficient equilibria in network design games via subsidies. SPAA 2012: 277-286 - [c15]Angelo Fanelli
The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE 2012: 546-552 - 2011
- [j7]Vittorio Bilò
Graphical Congestion Games. Algorithmica 61(2): 274-297 (2011) - [j6]Angelo Fanelli
On best response dynamics in weighted congestion games with polynomial delays. Distributed Comput. 24(5): 245-254 (2011) - [j5]Angelo Fanelli
Experimental Evaluations of Algorithms for IP Table Minimization. J. Interconnect. Networks 12(4): 299-318 (2011) - [j4]Vittorio Bilò
Performance of One-Round Walks in Linear Congestion Games. Theory Comput. Syst. 49(1): 24-45 (2011) - [c14]Ioannis Caragiannis
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS 2011: 532-541 - [c13]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli
Dynamics of Profit-Sharing Games. IJCAI 2011: 37-42 - [i5]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Efficient computation of approximate pure Nash equilibria. CoRR abs/1104.2690 (2011) - [i4]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis:
Enforcing efficient equilibria in network design games via subsidies. CoRR abs/1104.4423 (2011) - [i3]Angelo Fanelli, Luca Moscardelli, Alexander Skopalik:
On the Impact of Fair Best Response Dynamics. CoRR abs/1104.5642 (2011) - [i2]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions. CoRR abs/1107.2248 (2011) - 2010
- [j3]Angelo Fanelli
On the Convergence of Multicast Games in Directed Networks. Algorithmica 57(2): 301-324 (2010) - [j2]Vittorio Bilò
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. Theory Comput. Syst. 47(2): 507-530 (2010) - [j1]Vittorio Bilò
When ignorance helps: Graphical multicast cost sharing games. Theor. Comput. Sci. 411(3): 660-671 (2010) - [c12]Vittorio Bilò
Computing Exact and Approximate Nash Equilibria in 2-Player Games. AAIM 2010: 58-69 - [c11]Vittorio Bilò
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT 2010: 90-101 - [c10]Angelo Fanelli
Stackelberg Strategies for Network Design Games. WINE 2010: 222-233 - [p1]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263 - [i1]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. CoRR abs/1010.5081 (2010)
2000 – 2009
- 2009
- [c9]Vittorio Bilò
Performances of One-Round Walks in Linear Congestion Games. SAGT 2009: 311-322 - [c8]Angelo Fanelli
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays. WINE 2009: 55-66 - 2008
- [c7]Angelo Fanelli
The Speed of Convergence in Congestion Games under Best-Response Dynamics. ICALP (1) 2008: 796-807 - [c6]Vittorio Bilò
When Ignorance Helps: Graphical Multicast Cost Sharing Games. MFCS 2008: 108-119 - [c5]Vittorio Bilò
Graphical congestion games with linear latencies. SPAA 2008: 194-196 - [c4]Vittorio Bilò
Graphical Congestion Games. WINE 2008: 70-81 - 2007
- [c3]Angelo Fanelli
On the convergence of multicast games in directed networks. SPAA 2007: 330-338 - [c2]Angelo Fanelli
Experimental Evaluations of Algorithms for IP Table Minimization. WEA 2007: 324-337 - 2006
- [c1]Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. MFCS 2006: 363-374
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 01:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: