Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > econ > arXiv:2304.08008

Help | Advanced Search

Economics > General Economics

arXiv:2304.08008 (econ)
[Submitted on 17 Apr 2023 (v1) , last revised 16 May 2025 (this version, v7)]

Title: Unlocking Democratic Efficiency: How Coordinated Outcome-Contingent Promises Shape Decisions

Title: 解锁民主效率:协调的结果依赖承诺如何影响决策

Authors:Ali Lazrak, Jianfeng Zhang
Abstract: We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through coordinated non-negative transfer promises, made prior to voting and contingent on the vote outcome. In equilibrium, these transfers are structured to prevent any coalition from profitably deviating in a coordinated way, while minimizing total transfers. We provide a complete characterization of these `strong' equilibria and show that they exist, are indeterminate, efficient, and involve transfers from high- to low-utility members. Such transfers prevent opponents from swaying less enthusiastic supporters and may be directed not only to opponents but also to lukewarm supporters.
Abstract: 我们考虑一个委员会在配额规则下投票决定是否采用改革,成员们对改革的价值看法不同,一些人支持,一些人反对。 我们研究成员如何通过协调的非负转移承诺影响彼此的投票,这些承诺在投票前作出,并取决于投票结果。 在均衡状态下,这些转移被设计成防止任何联盟以协调的方式有利地偏离,同时最小化总转移量。 我们提供了这些“强”均衡的完整描述,并证明它们存在、不确定、有效,并涉及从高收益成员到低收益成员的转移。 这些转移可以防止反对者影响热情不高的支持者,并且不仅可能指向反对者,也可能指向态度模棱两可的支持者。
Comments: Previous title of this paper: Democratic Policy Decisions with Decentralized Promises Contingent on Vote Outcome
Subjects: General Economics (econ.GN)
Cite as: arXiv:2304.08008 [econ.GN]
  (or arXiv:2304.08008v7 [econ.GN] for this version)
  https://doi.org/10.48550/arXiv.2304.08008
arXiv-issued DOI via DataCite

Submission history

From: Ali Lazrak [view email]
[v1] Mon, 17 Apr 2023 06:17:26 UTC (60 KB)
[v2] Mon, 22 May 2023 06:52:50 UTC (51 KB)
[v3] Wed, 24 May 2023 06:01:51 UTC (52 KB)
[v4] Mon, 24 Jul 2023 17:37:40 UTC (54 KB)
[v5] Tue, 5 Nov 2024 17:42:29 UTC (79 KB)
[v6] Sat, 15 Mar 2025 00:12:22 UTC (84 KB)
[v7] Fri, 16 May 2025 07:44:59 UTC (79 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
econ.GN
< prev   |   next >
new | recent | 2023-04
Change to browse by:
econ
q-fin
q-fin.EC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号