Collective Choice Theory in Collaborative Computing
| dc.creator | Eaves, Walter | |
| dc.date | 1999-05-10 | |
| dc.date.accessioned | 2026-07-07T03:24:05Z | |
| dc.date.available | 2026-07-07T03:24:05Z | |
| dc.description | This paper presents some fundamental collective choice theory for information system designers, particularly those working in the field of computer-supported cooperative work. This paper is focused on a presentation of Arrow's Possibility and Impossibility theorems which form the fundamental boundary on the efficacy of collective choice: voting and selection procedures. It restates the conditions that Arrow placed on collective choice functions in more rigorous second-order logic, which could be used as a set of test conditions for implementations, and a useful probabilistic result for analyzing votes on issue pairs. It also describes some simple collective choice functions. There is also some discussion of how enterprises should approach putting their resources under collective control: giving an outline of a superstructure of performative agents to carry out this function and what distributing processing technology would be needed. | |
| dc.description | 40 pages, 10 figures | |
| dc.identifier | https://arxiv.org/abs/cs/9905003 | |
| dc.identifier | http://arxiv.org/abs/cs/9905003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33194 | |
| dc.subject | Multiagent Systems | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | H.5.3 I.2.11 J.4 K.4.1 K.4.3 F.1.2 | |
| dc.title | Collective Choice Theory in Collaborative Computing | |
| dc.type | text |