Lista referatów

• 2017-12-21, godz. 10:15, 4790

  Marcin Waniek (Khalifa University of Science and Technology)

  Strategic Network Diffusion

  Spreading of ideas in a social network is usually modelled in the literature as a stochastic process. However, in many real-life applications the exact course of the diffusion can be guided by a certain individual or authority. Given this background, we analyse a setting in which the process of spre...

• 2017-12-07, godz. 10:15, 4790

  Jan Woźnica (Instytut Informatyki, UW)

  Strategic Evasion of Centrality Measures

  Among the most fundamental tools for social network analysis are centrality measures, which are designed to rank nodes according to various criteria. Similarly to other tools, they were built around the assumption that individuals in the network do not act strategically to evade analysis. Even the c...

• 2017-11-30, godz. 10:15, 4790

  Marcin Dziubiński (Instytut Informatyki, UW)

  Hide and seek game with heterogenous hiding places

  We study a conflict with multiple battlefields where two players, the hider and the seeker, choose their respective numbers of hiding places. The hiding places have different values and the score of the hider is the sum of values of the places chosen by him and not chosen by the seeker. The score of...

• 2017-11-09, godz. 10:15, 4790

  Tomasz Wąs (Instytut Informatyki, Uniwersytet Warszawski)

  An Axiomatization of the Eigenvector and Katz Centralities

  Feedback centralities are one of the key classes of centrality measures. They assess the importance of a vertex recursively, based on the importance of its neighbours. Feedback centralities includes the Eigenvector Centrality, as well as its variants, such as the Katz Centrality or the PageRank, and...

• 2017-10-26, godz. 10:15, 4790

  Krzysztof R. Apt (Instytut Informatyki, Uniwersytet Warszawski)

  Self-Stabilization Through the Lens of Game Theory

  In 1974 E.W. Dijkstra introduced the seminal concept of self-stabilization that turned out to be one of the main approaches to fault-tolerant computing. We show here how his three solutions can be formalized and reasoned about using the concepts of game theory. We also determine the precise number o...

• 2017-10-12, godz. 10:15, 4790

  Leonie Baumann (University of Cambridge)

  Identifying the best agent in a network

  This paper develops a mechanism for a principal to assign a prize to the most valuable agent from a set of heterogeneously valued agents in a network. The principal does not know the value of any agent. Agents are competing for the prize and they have a "knowledge network": If two agents are linked,...

• 2017-10-05, godz. 10:15, 4790

  Tomasz Janus (Instytut Informatyki UW)

  On Strong Equilibria and Improvement Dynamics in Network Creation Games

  We study strong equilibria in network creation games. These form a classical and well-studied class of games where a set of players form a network by buying edges to their neighbors at a cost of a fixed parameter a. The cost of a player is defined to be the cost of the bought edges plus the sum of d...

• 2017-06-22, godz. 10:15, 1780

  Krzysztof Puchta (Instytut Informatyki, UW)

  A cooperative solution for the three-nation problem of exploitation of the southern bluefin tuna

  W trakcie seminarium zaprezentowany zostanie artykuł "A Cooperative Solution for the Three-Nation Problem of Exploitation of the Southern Bluefin Tuna" autorstwa J. Krawczyka i B. Tolwinskiego W pracy: 1.) Rozwiązano problem gry kooperacyjnej. Do dalszych badań zostawiono: 2.) Z...

• 2017-05-18, godz. 10:15, 1780

  Jadwiga Sosnowska (Instytut Informatyki, UW)

  Attachment Centrality for Weighted Graphs

  Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature and a few dedicated centrality measures have been proposed. One of them is the Attachment Centrality that is the only one that satisfies certain natural axioms desirable for ...

• 2017-05-11, godz. 10:15, 1780

  Oskar Skibski (Instytut Informatyki, UW)

  Axiomatic Characterization of Distance-based Centralities

  I will present our initial results concerning the characterization of the distance-based centralities. First, we characterize distance based centralities using Sabidussi's operations of adding and moving edges. Then, by adding one axiom we obtain a natural class of additive distance-based centraliti...

Strony