Recognizing distributed approval voting forms and correspondences
type: Item
instance of: scholarly article
title: Recognizing distributed approval voting forms and correspondences
zbMATH Open document ID: 1545.91122
author: Endre Boros
author: Ondřej Čepek
author: Vladimir Gurvich
author: Kazuhisa Makino
published in: Annals of Operations Research
publication date: 2024-07-16T00:00:00Z
Mathematics Subject Classification ID: 91B12
zbMATH DE Number: 7881805
zbMATH Keywords: distributed approval voting
zbMATH Keywords: voting scheme
zbMATH Keywords: voting form
zbMATH Keywords: voting correspondence
zbMATH Keywords: polynomial time recognition algorithm
MaRDI profile type: Publication
cites work: Q4003461
cites work: A simple characterization of approval voting
cites work: Total tightness implies Nash-solvability for three-person game forms
cites work: Separable discrete functions: recognition and sufficient conditions
cites work: On effectivity functions of game forms
cites work: Stable effectivity functions and perfect graphs
cites work: Acyclic, or totally tight, two-person game forms: characterization and main properties
cites work: Q3430415
cites work: When are plurality rule voting games dominance-solvable?
cites work: Über kombinatorische Eigenschaften von Matrizen.
cites work: Q4724379
cites work: Q3035074
cites work: Q4278472
cites work: War and peace in veto voting
cites work: Graphen und Matrices.
cites work: Q5519710
cites work: Acyclicity of improvements in finite game forms
cites work: Weighted approval voting
cites work: Iterative voting and acyclic games
cites work: Normalized range voting broadly resists control
cites work: Q3332693
cites work: Dominance Solvable Voting Schemes
cites work: Q3677437
cites work: The learnability of voting rules
cites work: Q5635232
DOI: 10.1007/S10479-023-05430-2
description: scientific article; zbMATH DE number 7881805