On the complexity of exchanging

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/27400

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor	Universitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs
dc.contributor	Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.contributor.author	Molinero Albareda, Xavier
dc.contributor.author	Olsen, Martin
dc.contributor.author	Serna Iglesias, María José
dc.date	2015-03-24
dc.identifier.citation	Molinero, X.; Olsen, M.; Serna, M. "On the complexity of exchanging". 2015.
dc.identifier.uri	http://hdl.handle.net/2117/27400
dc.language.iso	eng
dc.relation	http://arxiv.org/abs/1503.06052v2
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs
dc.subject	Game theory
dc.subject	Computational complexity
dc.subject	Tradeness of Simple Games
dc.subject	Computational Complexity
dc.subject	Jocs, Teoria de
dc.subject	Complexitat computacional
dc.subject	Classificació AMS::68 Computer science::68Q Theory of computing
dc.subject	Classificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory
dc.title	On the complexity of exchanging
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning coalitions. We also look at the problem of turning winning coalitions into losing coalitions. We analyze the problem when the simple game is represented by a list of wining, losing, minimal winning or maximal loosing coalitions.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author