Mostra el registre d'ítem simple

dc.contributor.authorOlsen, Martin
dc.contributor.authorKurz, Sascha
dc.contributor.authorMolinero Albareda, Xavier
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2016-12-01T19:18:00Z
dc.date.available2016-12-01T19:18:00Z
dc.date.issued2016
dc.identifier.citationOlsen, M., Kurz, S., Molinero, X. On the construction of high dimensional simple games. A: European Conference on Artificial Intelligence. "ECAI 2016: 22nd European Conference on Artificial Intelligence: 29 August–2 September 2016, The Hague, The Netherlands: proceedings". New York: IOS Press, 2016, p. 880-885.
dc.identifier.isbn978-1-61499-672-9
dc.identifier.urihttp://hdl.handle.net/2117/97663
dc.description.abstractVoting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., “yes” and “no”, every voting system can be described by a (monotone) Boolean function : f0; 1gn ! f0; 1g. However, its naive encoding needs 2n bits. The subclass of threshold functions, which is sufficient for homogeneous agents, allows a more succinct representation using n weights and one threshold. For heterogeneous agents one can represent as an intersection of k threshold functions. Taylor and Zwicker have constructed a sequence of examples requiring k 2 n2 ¿1 and provided a construction guaranteeingk ¿ n bn=2c 2 2n¿o(n). The magnitude of the worst case situation was thought to be determined by Elkind et al. in 2008, but the analysis unfortunately turned out to be wrong. Here we uncover a relation to coding theory that allows the determination of the minimum number k for a subclass of voting systems. As an application, we give a construction for k 2n¿o(n), i.e., there is no gain from a representation complexity point of view.
dc.format.extent6 p.
dc.language.isoeng
dc.publisherIOS Press
dc.rights.urihttp://creativecommons.org/licenses/by-nc/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs
dc.subject.lcshGame theory
dc.subject.lcshVoting--Mathematical models
dc.titleOn the construction of high dimensional simple games
dc.typeConference report
dc.subject.lemacJocs, Teoria de
dc.subject.lemacVot -- Models matemàtics
dc.contributor.groupUniversitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::91 Game theory, economics, social and behavioral sciences::91B Mathematical economics
dc.subject.amsClassificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory
dc.subject.amsClassificació AMS::68 Computer science::68P Theory of data
dc.rights.accessOpen Access
local.identifier.drac19241770
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO//MTM2015-66818-P/ES/ASPECTOS MATEMATICOS, COMPUTACIONALES Y SOCIALES EN CONTEXTOS DE VOTACION Y DE COOPERACION./
local.citation.authorOlsen, M.; Kurz, S.; Molinero, X.
local.citation.contributorEuropean Conference on Artificial Intelligence
local.citation.pubplaceNew York
local.citation.publicationNameECAI 2016: 22nd European Conference on Artificial Intelligence: 29 August–2 September 2016, The Hague, The Netherlands: proceedings
local.citation.startingPage880
local.citation.endingPage885


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple