The executive branch, or government, is typically not elected directly by the people, but rather formed by another elected body or person such as the parliament or the president. As a result, its members are not directly accountable to the people, individually or as a group. We consider a scenario in which the members of the government are elected directly by the people, and wish to achieve proportionality while doing so. We propose a formal model consisting of $k$ offices, each with its own disjoint set of candidates, and a set of voters who provide approval ballots for all offices. We wish to identify good aggregation rules that assign one candidate to each office. As using a simple majority vote for each office independently might result in disregarding minority preferences altogether, here we consider an adaptation of the greedy variant of Proportional Approval Voting (GreedyPAV) to our setting, and demonstrate -- through computer-based simulations -- how voting for all offices together using this rule overcomes this weakness. We note that the approach is applicable also to a party that employs direct democracy, where party members elect the party's representatives in a coalition government.
翻译:行政部门或政府通常不是由人民直接选举,而是由另一个民选机构或个人,如议会或总统组成。因此,其成员不直接对人民、个人或群体负责。我们考虑一种政府成员直接由人民选举的情景,希望在这样做时实现比例相称性。我们提出了一个正式模式,由百万美元的办公室组成,每个办公室都有不连贯的候选人,以及一组为所有办公室提供核准选票的选民组成。我们希望确定一个良好的汇总规则,为每个办公室指派一名候选人。由于对每个办公室使用简单多数的投票方式可能会完全无视少数群体的偏好,我们在这里考虑将贪婪的按比例核准投票模式(GreedyPAV)适应我们的情况,并通过基于计算机的模拟,表明如何利用这一规则共同选举所有办公室,克服这一弱点。我们注意到,这一办法也适用于一个采用直接民主的政党,其中政党成员在联合政府中选举该党的代表。