Mostrar el registro sencillo del ítem
dc.contributor.author | Puerto Albandoz, Justo![]() |
es_ES |
dc.contributor.author | Perea Rojas Marcos, Federico![]() |
es_ES |
dc.date.accessioned | 2015-03-27T09:39:19Z | |
dc.date.available | 2015-03-27T09:39:19Z | |
dc.date.issued | 2013-10 | |
dc.identifier.issn | 0305-0548 | |
dc.identifier.uri | http://hdl.handle.net/10251/48387 | |
dc.description.abstract | In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with Oð4n Þ constraints whose coefficients belong to f−1; 0; 1g. We discuss the need of having all these constraints and empirically prove that they can be reduced to Oðkmax2n Þ, where kmax is a positive integer comparable with the number of players. A computational experience shows the applicability of our method over (pseudo)random transferable utility cooperative games with up to 18 players | es_ES |
dc.description.sponsorship | The authors want to thank Javier Arin, Safae El Haj Ben Ali, Guillermo Owen and Johannes H. Reijnierse for their useful and valuable help. The research of the authors has been partially supported by the projects FQM-5849 (Junta de Andalucia \ FEDER), and by the project MTM2010-19576-C02-01 (MICINN, Spain). This paper was written while the second author was enjoying a grant for a short postdoctoral research visit at the Instituto Universitario de Investigacion de Matematicas de la Universidad de Sevilla (IMUS). Special thanks are due to one anonymous referee for his/her valuable comments. | en_EN |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Computers and Operations Research | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Cooperative games | es_ES |
dc.subject | Nucleolus | es_ES |
dc.subject | Order median problem | es_ES |
dc.subject.classification | ESTADISTICA E INVESTIGACION OPERATIVA | es_ES |
dc.title | Finding the nucleolus of any n-person cooperative game by a single linear program | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.cor.2013.03.011 | |
dc.relation.projectID | info:eu-repo/grantAgreement/Junta de Andalucía//P10-FQM-5849/ES/Nuevos desafíos de la matemática combinatoria: Enfoques no estándares en optimización discreta y álgebra computacional. Aplicaciones/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MICINN//MTM2010-19576-C02-01/ES/DISEÑO OPTIMO EN REDES LOGISTICAS/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Instituto Universitario Mixto Tecnológico de Informática - Institut Universitari Mixt Tecnològic d'Informàtica | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat | es_ES |
dc.description.bibliographicCitation | Puerto Albandoz, J.; Perea Rojas Marcos, F. (2013). Finding the nucleolus of any n-person cooperative game by a single linear program. Computers and Operations Research. 40(10):2308-2313. https://doi.org/10.1016/j.cor.2013.03.011 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.cor.2013.03.011 | es_ES |
dc.description.upvformatpinicio | 2308 | es_ES |
dc.description.upvformatpfin | 2313 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 40 | es_ES |
dc.description.issue | 10 | es_ES |
dc.relation.senia | 245724 | |
dc.identifier.eissn | 1873-765X | |
dc.contributor.funder | Ministerio de Ciencia e Innovación | es_ES |
dc.contributor.funder | Junta de Andalucía | es_ES |
dc.contributor.funder | Universidad de Sevilla | es_ES |