Spatial voting games, relation algebra and RelView
DOI10.1016/j.jlap.2014.02.003zbMath1434.91031OpenAlexW1972486778WikidataQ114851537 ScholiaQ114851537MaRDI QIDQ406437
Rudolf Berghammer, Agnieszka Rusinowska, H. C. M. De Swart
Publication date: 8 September 2014
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2014.02.003
relation algebracovering relationPareto setuncovered setbeating relationmajority corespatial voting game
Symbolic computation and algebraic computation (68W30) Games involving graphs (91A43) Voting theory (91B12) Cylindric and polyadic algebras; relation algebras (03G15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applying relational algebra and REL VIEW to coalition formation
- Applying relation algebra and RelView to measures in a social network
- The geometry of the uncovered set in the three-voter spatial model
- Intransitivities in multidimensional voting models and some implications for agenda control
- Computing tournament solutions using relation algebra and RelView
- An interdisciplinary approach to coalition formation
- Social Networks: Prestige, Centrality, and Influence
- Computations on Simple Games Using RelView
- Computational Social Choice Using Relation Algebra and RelView
- Generalized Symmetry Conditions at a Core Point
- Instability of Simple Dynamic Games
- General Conditions for Global Intransitivities in Formal Voting Models
- Social Software for Coalition Formation
- Theory and Applications of Relational Structures as Knowledge Instruments
This page was built for publication: Spatial voting games, relation algebra and RelView