Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Electing the Most Probable Wit...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains
Bibliographic Details
Main Authors:
Elkind, E
,
Shah, N
Format:
Conference item
Published:
2014
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
The probability of intransitivity in dice and close elections
by: Hązła, Jan, et al.
Published: (2021)
The probability of intransitivity in dice and close elections
by: Hązła, Jan, et al.
Published: (2021)
Intransitive verbs in Enets: A contribution to the typology of split intransitivity
by: Khanina Olesya, et al.
Published: (2019-06-01)
What do multiwinner voting rules do? An experiment over the two-dimensional Euclidean domain
by: Elkind, E, et al.
Published: (2017)
What is intransitive noninterference?
by: Roscoe, A, et al.
Published: (1999)