EconStor >
ifo Institut – Leibniz-Institut für Wirtschaftsforschung an der Universität München >
CESifo Working Papers, CESifo Group Munich >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/26003
  

Full metadata record

DC FieldValueLanguage
dc.contributor.authorKrasa, Stefanen_US
dc.contributor.authorPolborn, Mattiasen_US
dc.date.accessioned2007-07-24en_US
dc.date.accessioned2009-07-28T08:14:45Z-
dc.date.available2009-07-28T08:14:45Z-
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/10419/26003-
dc.description.abstractWe introduce a general framework in which politicians choose a (possibly infinite) sequence of binary policies. The two competing candidates are exogenously committed to particular actions on a subset of these issues, while they can choose any policy for the remaining issues to maximize their winning probability. Citizens have general preferences over policies, and the distribution of preferences may be uncertain. We show that a special case of the model, the weighted-issue model, provides a tractable multidimensional model of candidate competition that can generate (i) policy divergence in pure and mixed strategies, (ii) adoption of minority positions, and (iii) inefficient outcomes.en_US
dc.language.isoengen_US
dc.publisherCESifo Münchenen_US
dc.relation.ispartofseriesCESifo working paper 1958en_US
dc.subject.jelD72en_US
dc.subject.jelD60en_US
dc.subject.ddc330en_US
dc.subject.stwMedian Voteren_US
dc.subject.stwWahlverhaltenen_US
dc.subject.stwWohlfahrtseffekten_US
dc.subject.stwTheorieen_US
dc.titleMajority-efficiency and competition-efficiency in a binary policy modelen_US
dc.typeWorking Paperen_US
dc.identifier.ppn538092815en_US
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungen-
Appears in Collections:CESifo Working Papers, CESifo Group Munich

Files in This Item:
File Description SizeFormat
538092815.PDF383.9 kBAdobe PDF
No. of Downloads: Counter Stats
Show simple item record
Download bibliographical data as: BibTeX

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.