Recognizing distributed approval voting forms and correspondences
From MaRDI portal
Publication:6573343
Recommendations
Cites work
- scientific article; zbMATH DE number 4133765 (Why is no real title available?)
- scientific article; zbMATH DE number 3864918 (Why is no real title available?)
- scientific article; zbMATH DE number 3898540 (Why is no real title available?)
- scientific article; zbMATH DE number 53233 (Why is no real title available?)
- scientific article; zbMATH DE number 497456 (Why is no real title available?)
- scientific article; zbMATH DE number 3997489 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- A simple characterization of approval voting
- Acyclic, or totally tight, two-person game forms: characterization and main properties
- Acyclicity of improvements in finite game forms
- Approval voting
- Dominance Solvable Voting Schemes
- Graphen und Matrices.
- Iterative voting and acyclic games
- Normalized range voting broadly resists control
- On effectivity functions of game forms
- Separable discrete functions: recognition and sufficient conditions
- Stable effectivity functions and perfect graphs
- The learnability of voting rules
- Total tightness implies Nash-solvability for three-person game forms
- War and peace in veto voting
- Weighted approval voting
- When are plurality rule voting games dominance-solvable?
- Über kombinatorische Eigenschaften von Matrizen.
This page was built for publication: Recognizing distributed approval voting forms and correspondences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573343)