Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Àlvarez C and Buisan A. (2023). On the PoA Conjecture: Trees versus Biconnected Components. SIAM Journal on Discrete Mathematics. 10.1137/21M1466426. 37:2. (1030-1052). Online publication date: 30-Jun-2023.

    https://epubs.siam.org/doi/10.1137/21M1466426

  • Friedrich T, Gawendowicz H, Lenzner P and Zahn A. The Impact of Cooperation in Bilateral Network Creation. Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. (321-331).

    https://doi.org/10.1145/3583668.3594588

  • Wang Q. On Tree Equilibria in Max-Distance Network Creation Games. Algorithmic Game Theory. (293-310).

    https://doi.org/10.1007/978-3-031-15714-1_17

  • Bilò D, Gualà L, Leucci S and Proietti G. (2021). Network Creation Games with Traceroute-Based Strategies. Algorithms. 10.3390/a14020035. 14:2. (35).

    https://www.mdpi.com/1999-4893/14/2/35

  • Abam M and Qafari M. (2019). Geometric spanner games. Theoretical Computer Science. 10.1016/j.tcs.2019.07.020. Online publication date: 1-Jul-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397519304554

  • Lavrov M, Loh P and Messegué A. (2019). Distance-Uniform Graphs with Large Diameter. SIAM Journal on Discrete Mathematics. 10.1137/17M115791X. 33:2. (994-1005). Online publication date: 1-Jan-2019.

    https://epubs.siam.org/doi/10.1137/17M115791X

  • Kaklamanis C, Kanellopoulos P and Tsokana S. (2018). On network formation games with heterogeneous players and basic network creation games. Theoretical Computer Science. 10.1016/j.tcs.2017.03.041. 717. (62-72). Online publication date: 1-Mar-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397517302803

  • Friedrich T, Ihde S, Keßler C, Lenzner P, Neubert S and Schumann D. Efficient Best Response Computation for Strategic Network Formation Under Attack. Algorithmic Game Theory. (199-211).

    https://doi.org/10.1007/978-3-319-66700-3_16

  • Àlvarez C, Blesa M, Duch A, Messegué A and Serna M. (2016). Celebrity games. Theoretical Computer Science. 648:C. (56-71). Online publication date: 4-Oct-2016.

    https://doi.org/10.1016/j.tcs.2016.08.005

  • Chauhan A, Lenzner P, Melnichenko A and Münn M. (2016). On Selfish Creation of Robust Networks. Algorithmic Game Theory. 10.1007/978-3-662-53354-3_12. (141-152).

    http://link.springer.com/10.1007/978-3-662-53354-3_12

  • Àlvarez C and Messeguè A. (2016). Max Celebrity Games. Algorithms and Models for the Web Graph. 10.1007/978-3-319-49787-7_8. (88-99).

    http://link.springer.com/10.1007/978-3-319-49787-7_8

  • Kaklamanis C, Kanellopoulos P and Tsokana S. (2016). On Network Formation Games with Heterogeneous Players and Basic Network Creation Games. Algorithmic Aspects in Information and Management. 10.1007/978-3-319-41168-2_11. (125-136).

    http://link.springer.com/10.1007/978-3-319-41168-2_11