Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Gilbert, Hugo"'
This paper is dedicated to a robust ordinal method for learning the preferences of a decision maker between subsets. The decision model, derived from Fishburn and LaValle (1996) and whose parameters we learn, is general enough to be compatible with a
Externí odkaz:
http://arxiv.org/abs/2308.03376
When allocating indivisible items to agents, it is known that the only strategyproof mechanisms that satisfy a set of rather mild conditions are constrained serial dictatorships: given a fixed order over agents, at each step the designated agent choo
Externí odkaz:
http://arxiv.org/abs/2301.06086
We introduce new power indices to measure the a priori voting power of voters in liquid democracy elections where an underlying network restricts delegations. We argue that our power indices are natural extensions of the standard Penrose-Banzhaf inde
Externí odkaz:
http://arxiv.org/abs/2301.02462
Publikováno v:
13th Multidisciplinary Workshop on Advances in Preference Handling, Jul 2022, Vienna, Austria
This paper is dedicated to a cautious learning methodology for predicting preferences between alternatives characterized by binary attributes (formally, each alternative is seen as a subset of attributes). By "cautious", we mean that the model learne
Externí odkaz:
http://arxiv.org/abs/2206.07341
We consider a variant of the prize collecting Steiner tree problem in which we are given a \emph{directed graph} $D=(V,A)$, a monotone submodular prize function $p:2^V \rightarrow \mathbb{R}^+ \cup \{0\}$, a cost function $c:V \rightarrow \mathbb{Z}^
Externí odkaz:
http://arxiv.org/abs/2204.12162
Publikováno v:
In European Journal of Operational Research 1 January 2025 320(1):146-159
Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class of simple games is notably well suited to study the relative importan
Externí odkaz:
http://arxiv.org/abs/2104.03692
In this paper, we investigate the so-called ODP-problem that has been formulated by Caragiannis and Micha [10]. Here, we are in a setting with two election alternatives out of which one is assumed to be correct. In ODP, the goal is to organise the de
Externí odkaz:
http://arxiv.org/abs/2104.01828
Autor:
Angriman, Eugenio, Becker, Ruben, D'Angelo, Gianlorenzo, Gilbert, Hugo, van der Grinten, Alexander, Meyerhenke, Henning
Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems occur. In this
Externí odkaz:
http://arxiv.org/abs/2010.15435
The influence maximization paradigm has been used by researchers in various fields in order to study how information spreads in social networks. While previously the attention was mostly on efficiency, more recently fairness issues have been taken in
Externí odkaz:
http://arxiv.org/abs/2010.03438