Conceptio › Archive › arXiv (OAI)
arXiv (OAI) open access

Marginal Mechanisms For Balanced Exchange

Manjunath, Vikram et al. · 2025 · arxiv_oai
arXiv (OAI) · Papers · 2025
Open Source ↗Direct PDF ↓
theoretical-economics
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2502.06499] Marginal Mechanisms For Balanced Exchange Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Economics > Theoretical Economics arXiv:2502.06499 (econ) [Submitted on 10 Feb 2025 ( v1 ), last revised 11 Apr 2026 (this version, v2)] Title: Marginal Mechanisms For Balanced Exchange Authors: Vikram Manjunath , Alexander Westkamp View a PDF of the paper titled Marginal Mechanisms For Balanced Exchange, by Vikram Manjunath and Alexander Westkamp View PDF HTML (experimental) Abstract: We study balanced exchange problems in which agents with responsive preferences are endowed with multiple indivisible objects and can trade without transfers (e.g. shift exchange, time-banking). Eliciting full preferences over bundles is infeasible, so mechanisms often rely solely on marginal preferences, that is, rankings of individual objects. We characterize when eliciting only marginal preferences is enough to unambiguously identify allocations that are efficient and individually rational in the sense that these properties hold with respect to any responsive preferences consistent with the elicited marginals. We parameterize domains of marginal preferences by which indifference classes can contain endowed and non-endowed objects. We show that the essentially unique maximal domain for which an unambiguously efficient and unambiguously individually rational marginal mechanism exists is trichotomous: agents rank objects in three tiers, with the bottom tier containing no endowed objects. We also consider incentives for truthful preference revelation. The maximal domain for which an efficient, individually rational, and strategy-proof mechanism exists is strongly trichotomous: agents rank objects in three tiers, with the bottom tier containing no endowed objects and the middle tier containing no non-endowed objects. The canonical marginal mechanism achieving our three desiderata on that domain is a serial dictatorship over individually rational allocations. When employed on the larger trichotomous domain, this mechanism still admits a weakly dominant strategy: reveal the top tier truthfully and omit non-endowed objects from the middle tier. We propose a family of gradual-revelation mechanisms that are also unambiguously efficient and individually rational on the trichotomous domain while providing better incentives for truthful revelation across all three tiers. Subjects: Theoretical Economics (econ.TH) Cite as: arXiv:2502.06499 [econ.TH] (or arXiv:2502.06499v2 [econ.TH] for this version) https://doi.org/10.48550/arXiv.2502.06499 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Vikram Manjunath [ view email ] [v1] Mon, 10 Feb 2025 14:16:53 UTC (1,053 KB) [v2] Sat, 11 Apr 2026 12:52:36 UTC (47 KB) Full-text links: Access Paper: View a PDF of the paper titled Marginal Mechanisms For Balanced Exchange, by Vikram Manjunath and Alexander Westkamp View PDF HTML (experimental) TeX Source view license Current browse context: econ.TH < prev | next > new | recent | 2025-02 Change to browse by: econ References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

Record · ID 139125 · SHA-256 d21aa4b4a06ca10b
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive