Show item record

dc.contributor.authorAndersson, Tommy
dc.contributor.authorEhlers, Lars
dc.contributor.authorSvensson, Lars-Gunnar
dc.date.accessioned2012-05-28T17:39:16Z
dc.date.available2012-05-28T17:39:16Z
dc.date.issued2012-04
dc.identifier.urihttp://hdl.handle.net/1866/8259
dc.publisherUniversité de Montréal. Département de sciences économiques.fr
dc.subject'epsilon'-incentive compatibilityen
dc.subjectCompetitive allocationen
dc.subjectBudget-balanceen
dc.subjectIndivisibilitiesen
dc.title(Minimally) 'epsilon'-incentive compatible competitive equilibria in economies with indivisibilitiesen
dc.typeArticle
dc.contributor.affiliationUniversité de Montréal. Faculté des arts et des sciences. Département de sciences économiques
dcterms.abstractWe consider competitive and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In 'small' economies, we identify under classical preferences each agent's maximal gain from manipulation. Using this result we find the competitive and budget-balanced allocation rules which are minimally manipulable for each preference profile in terms of any agent's maximal gain. If preferences are quasi-linear, then we can find a competitive and budget-balanced allocation rule such that for any problem, the maximal utility gain from manipulation is equalized among all agents.en
dcterms.isPartOfurn:ISSN:0709-9231
dcterms.languageengen
UdeM.VersionRioxxVersion publiée / Version of Record
oaire.citationTitleCahier de recherche
oaire.citationIssue2012-03


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show item record

This document disseminated on Papyrus is the exclusive property of the copyright holders and is protected by the Copyright Act (R.S.C. 1985, c. C-42). It may be used for fair dealing and non-commercial purposes, for private study or research, criticism and review as provided by law. For any other use, written authorization from the copyright holders is required.