An Ordinal Banzhaf Index for Social Ranking

Authors: Hossein Khani, Stefano Moretti, Meltem Öztürk

IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We introduce a new method to rank single elements given an order over their sets. For this purpose, we extend the game theoretic notion of marginal contribution and of Banzhaf index to our ordinal framework. Furthermore, we characterize the resulting ordinal Banzhaf solution by means of a set of properties inspired from those used to axiomatically characterize another solution from the literature: the ceteris paribus majority.
Researcher Affiliation Academia Hossein Khani , Stefano Moretti and Meltem Ozt urk Universit e Paris-Dauphine, PSL Research University, CNRS, LAMSADE, Place du Mar echal de Lattre de Tassigny, F-75775 Paris cedex 16, France {hossein.khani, stefano.moretti, meltem.ozturk}@lamsade.dauphine.fr
Pseudocode No Information insufficient. The paper does not contain any structured pseudocode or algorithm blocks.
Open Source Code No Information insufficient. The paper does not contain any statement about open-source code availability or provide links to a code repository.
Open Datasets No Information insufficient. The paper is theoretical and does not conduct experiments using publicly available datasets for training.
Dataset Splits No Information insufficient. The paper is theoretical and does not involve dataset splits for validation or training.
Hardware Specification No Information insufficient. The paper is theoretical and does not describe any hardware used for experiments.
Software Dependencies No Information insufficient. The paper is theoretical and does not list any specific software dependencies with version numbers.
Experiment Setup No Information insufficient. The paper is theoretical and does not describe an experimental setup, hyperparameters, or training configurations.