Matching with quorums

dc.contributor.affiliationFGV
dc.contributor.authorMonte, Daniel
dc.contributor.authorTumennasan, Norovsambuu
dc.contributor.unidadefgvEscolas::EESPpor
dc.date.accessioned2018-10-25T18:23:55Z
dc.date.available2018-10-25T18:23:55Z
dc.date.issued2013
dc.description.abstractIn the problem of allocating workers to different projects, where each project needs a minimum number of workers assigned to it, the serial dictatorship mechanism is neither strategy proof nor Pareto efficient. We therefore propose a strategy-proof and Pareto-efficient mechanism. © 2013.eng
dc.identifierhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84876446650&doi=10.1016%2fj.econlet.2013.03.007&partnerID=40&md5=e84aed9b754db0299532b68d64fc378c
dc.identifier.doi10.1016/j.econlet.2013.03.007
dc.identifier.issn0165-1765
dc.identifier.scopus2-s2.0-84876446650
dc.identifier.urihttps://hdl.handle.net/10438/25403
dc.language.isoeng
dc.relation.ispartofseriesEconomics Letters
dc.rights.accessRightsrestrictedAccesseng
dc.sourceScopus
dc.subjectEfficiencyeng
dc.subjectMatchingeng
dc.subjectSerial Dictatorshipeng
dc.subject.bibliodataTrabalhadores - Projetospor
dc.titleMatching with quorumseng
dc.typeArticle (Journal/Review)eng

Arquivos

Pacote original

Agora exibindo 1 - 1 de 1
Carregando...
Imagem de Miniatura
Nome:
2-s2.0-84876446650.pdf
Tamanho:
205.71 KB
Formato:
Adobe Portable Document Format
Descrição: