activity
20112026
most citedAxiomatic Characterization of PageRank

3 citations · 4 across the 6 of their papers we have counts for

collaborators

11 papers

cs.SI2026

A Unified Framework for Extending Centrality Measures to Groups

Piotr Kępczyński, Oskar Skibski

We propose a unified framework for extending centrality measures from individual nodes to groups. For each centrality measure, we introduce four group variants---maximum, minimum,…

cs.SI2026

Group Vitality Indices: Axioms and Algorithms

Natalia Kucharczuk, Oskar Skibski

We consider the problem of assessing a group of nodes in a network. Our focus is on vitality indices -- a natural class of centrality measures that evaluate the importance of a nod…

cs.SI2021

PageRank for Edges: Axiomatic Characterization

Natalia Kucharczuk, Tomasz Was, Oskar Skibski

Edge centrality measures are functions that evaluate the importance of edges in a network. They can be used to assess the role of a backlink for the popularity of a website as well…

cs.DB2021

How do centrality measures choose the root of trees?

Cristian Riveros, Jorge Salas, Oskar Skibski

Centrality measures are widely used to assign importance to graph-structured data. Recently, understanding the principles of such measures has attracted a lot of attention. Given t…

cs.SI2021

Axiomatic Analysis of Medial Centrality Measures

Wiktoria Kosny, Oskar Skibski

We perform the first axiomatic analysis of medial centrality measures. These measures, also called betweenness-like centralities, assess the role of a node in connecting others in…

cs.SI2021

Closeness Centrality via the Condorcet Principle

Oskar Skibski

We uncover a new relation between Closeness centrality and the Condorcet principle. We define a Condorcet winner in a graph as a node that compared to any other node is closer to m…

cs.SI2021

An Axiom System for Feedback Centralities

Tomasz Wąs, Oskar Skibski

In recent years, the axiomatic approach to centrality measures has attracted attention in the literature. However, most papers propose a collection of axioms dedicated to one or tw…

cs.SI2020★ 3 cited

Axiomatic Characterization of PageRank

Tomasz Wąs, Oskar Skibski

This paper examines the fundamental problem of identifying the most important nodes in a network. We use an axiomatic approach to this problem. Specifically, we propose six simple…

cs.GT2019

Complexity of Computing the Shapley Value in Games with Externalities

Oskar Skibski

We study the complexity of computing the Shapley value in games with externalities. We focus on two representations based on marginal contribution nets (embedded MC-nets and weight…

cs.GT2013★ 1 cited

The Shapley Axiomatization for Values in Partition Function Games

Oskar Skibski, Tomasz P. Michalak, Michael Wooldridge

One of the long-debated issues in coalitional game theory is how to extend the Shapley value to games with externalities (partition-function games). When externalities are present,…

cs.GT2011

Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities

Oskar Skibski

The Shapley value is one of the most important solution concepts in cooperative game theory. In coalitional games without externalities, it allows to compute a unique payoff divisi…