Optimal algorithms for exact, inexact, and approval voting

The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is sma...

Full description

Saved in:
Bibliographic Details
Published inFault-Tolerant Computing Symposium (FTCS-22) pp. 404 - 411
Main Author Parhami, B.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1992
Subjects
Algorithm design and analysis
Degradation
Extraterrestrial measurements
Frequency
Hardware
High performance computing
Redundancy
Software performance
Sorting
Voting
Online AccessGet full text
ISBN9780818628757
0818628758
DOI10.1109/FTCS.1992.243595

Cover

Abstract The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small. Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta (nlogn) algorithms for both exact and inexact voting as well as for certain approval-voting schemes. An unordered input object space leads to worst-case Omega (n/sup 2/) algorithms, even when a distance metric can be defined on the input object space. Some observations on the relationship of voting to other well-studied problems, particularly sorting, are also included.< >
AbstractList The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small. Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta (nlogn) algorithms for both exact and inexact voting as well as for certain approval-voting schemes. An unordered input object space leads to worst-case Omega (n/sup 2/) algorithms, even when a distance metric can be defined on the input object space. Some observations on the relationship of voting to other well-studied problems, particularly sorting, are also included.< >
Author Parhami, B.
Author_xml – sequence: 1
  givenname: B.
  surname: Parhami
  fullname: Parhami, B.
  organization: Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
BookMark eNotj89LwzAcxQMqqFvv4il_gK35Js0vb1KcCoMdNs8jaZIZ6dqShqH_vYXtXd47fHi8d4-u-6H3CD0AqQCIfl7tmm0FWtOK1oxrfoUKLRVRoARVkstbVEzTD5nFuWJQ36GXzZjj0XTYdIchxfx9nHAYEva_ps1POPaXYHqHzTim4TSzpyHH_rBEN8F0ky8uvkBfq7dd81GuN--fzeu6jCDrXIrQShl0cNIZrhknzjLClGpFbYVyoBRYSkAYIVtNLdGOOOYdFx4sodyxBXo890bv_X5M89z0tz8fZP_aj0c7
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/FTCS.1992.243595
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 411
ExternalDocumentID 243595
Genre orig-research
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i174t-6fc77f9fd7da59350db30388c64b68d1881b2016a67c92b09d0d3ed56e1b025d3
IEDL.DBID RIE
ISBN 9780818628757
0818628758
IngestDate Tue Aug 26 16:41:17 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i174t-6fc77f9fd7da59350db30388c64b68d1881b2016a67c92b09d0d3ed56e1b025d3
PageCount 8
ParticipantIDs ieee_primary_243595
PublicationCentury 1900
PublicationDate 19920000
PublicationDateYYYYMMDD 1992-01-01
PublicationDate_xml – year: 1992
  text: 19920000
PublicationDecade 1990
PublicationTitle Fault-Tolerant Computing Symposium (FTCS-22)
PublicationTitleAbbrev FTCS
PublicationYear 1992
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558314
Score 1.2418275
Snippet The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to...
SourceID ieee
SourceType Publisher
StartPage 404
SubjectTerms Algorithm design and analysis
Degradation
Extraterrestrial measurements
Frequency
Hardware
High performance computing
Redundancy
Software performance
Sorting
Voting
Title Optimal algorithms for exact, inexact, and approval voting
URI https://ieeexplore.ieee.org/document/243595
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwELVoT5zYitjlA0eSZvMSrhVVhcQi0Uq9VbbHgYo2QW2CEF-Pl7YIxIGbk4MVK9a85_G8NwhdgsEEmoEMFI91kElJA5ExFQBhjGtJ00JY7fDdPR2MstsxGa98tp0WRmvtis90aIfuLh8q1dhUWTfJrIy0hVqMUy_V2qRTIkJ46po4OY82cw4gfOWvs35m61vKKO_2h70nK9RLQj_nj94qDlr6O16zvXSOhLai5DVsahmqz19-jf_86l3U-dbw4ccNOu2hLV0eoOsHEyHmYobF7LlaTOuX-RIb1or1h1D1FTaM0w9ECdi5jZt9iN8rWxrdQaP-zbA3CFbdE4KpOWXUgRXxsCIvgIEgeUoikKm1flE0k5RDzA1hNehPBWUqT2SUQwSpBkJ1LA0RgvQQtcuq1EcIxwCGiMVCFpbAABeUJEXOeRGBMFFKHqN9u-zJmzfImPgVn_z59hRt-4pXm8U4Q-160ehzg-u1vHB_9AuLu58V
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwELWgDDDxVcQ3HhhJmg_bcVgrqgJtQaKVulV2zoGKNkFtghC_Httpi0AMbE4GK1ase8_ne-8QugSNCYyAdBLuK4dIyRxBosQBGkVcSRamwmiHuz3WHpC7IR0ufLatFkYpZYvPlGuG9i4f8qQ0qbJGQIyMdB1tUEIIrcRaq4SKRykPbRsn69KmTwKULxx2ls_R8p7SixutfvPJSPUCt5r1R3cVCy6t7Uq1PbeehKam5NUtC-kmn78cG__53Tuo_q3iw48rfNpFayrbR9cPOkZMxQSLyXM-Gxcv0znWvBWrD5EUV1hzzmogMsDWb1zvRPyem-LoOhq0bvrNtrPon-CM9TmjcIyMJ0rjFCIQNA6pBzI05i8JI5Jx8LmmrBr_mWBREgfSi8GDUAFlypeaCkF4gGpZnqlDhH0ATcV8IVNDYYALRoM05jz1QOg4JY_Qnln26K2yyBhVKz7-8-0F2mz3u51R57Z3f4K2qvpXk9M4RbViVqozjfKFPLd_9wsXYaJi
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Fault-Tolerant+Computing+Symposium+%28FTCS-22%29&rft.atitle=Optimal+algorithms+for+exact%2C+inexact%2C+and+approval+voting&rft.au=Parhami%2C+B.&rft.date=1992-01-01&rft.pub=IEEE&rft.isbn=9780818628757&rft.spage=404&rft.epage=411&rft_id=info:doi/10.1109%2FFTCS.1992.243595&rft.externalDocID=243595
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818628757/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818628757/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818628757/sc.gif&client=summon&freeimage=true