IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2606.04959.html

Fairness and Strategy-Proofness in Automated Market Makers

Author

Listed:
  • Frank M. V. Feys

Abstract

No deployed automated market maker lets its liquidity providers vote on the trading function. We show this is structural, not an oversight. On the weighted-product family with $n \geq 3$ assets, no aggregation rule is at once fair and strategy-proof. Arrovian fairness forces a unique form, the weighted Aitchison centroid, the weighted geometric mean of the providers' preferred pools. But fairness forces mean-type aggregation and strategy-proofness forces median-type, and the only rule that is both is a single-provider dictator. The obstruction is sharp: it vanishes at $n = 2$, where a fair strategy-proof rule exists. Under the Frongillo--Papireddygari--Waggoner equivalence, the centroid is Genest's logarithmic opinion pool, and the impossibility transfers to externally Bayesian pooling.

Suggested Citation

  • Frank M. V. Feys, 2026. "Fairness and Strategy-Proofness in Automated Market Makers," Papers 2606.04959, arXiv.org.
  • Handle: RePEc:arx:papers:2606.04959
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2606.04959
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    2. Graciela Chichilnisky, 1982. "Social Aggregation Rules and Continuity," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 97(2), pages 337-352.
    3. Christopher P. Chambers & Federico Echenique & Takashi Hayashi, 2024. "Manipulation of Belief Aggregation Rules," Papers 2405.01655, arXiv.org.
    4. Nehring, Klaus & Puppe, Clemens, 2007. "The structure of strategy-proof social choice -- Part I: General characterization and possibility results on median spaces," Journal of Economic Theory, Elsevier, vol. 135(1), pages 269-305, July.
    5. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    6. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
    7. Kim C. Border & J. S. Jordan, 1983. "Straightforward Elections, Unanimity and Phantom Voters," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 50(1), pages 153-170.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2020. "Arrow on domain conditions: a fruitful road to travel," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(2), pages 237-258, March.
    2. Chatterji, Shurojit & Zeng, Huaxia, 2018. "On random social choice functions with the tops-only property," Games and Economic Behavior, Elsevier, vol. 109(C), pages 413-435.
    3. Tobias Rachidi, 2020. "Optimal Voting Mechanisms on Generalized Single-Peaked Domains," CRC TR 224 Discussion Paper Series crctr224_2020_214, University of Bonn and University of Mannheim, Germany.
    4. Reffgen, Alexander, 2015. "Strategy-proof social choice on multiple and multi-dimensional single-peaked domains," Journal of Economic Theory, Elsevier, vol. 157(C), pages 349-383.
    5. Roy, Souvik & Sadhukhan, Soumyarup, 2021. "A unified characterization of the randomized strategy-proof rules," Journal of Economic Theory, Elsevier, vol. 197(C).
    6. Shurojit Chatterji & Huaxia Zeng, 2022. "A Taxonomy of Non-dictatorial Unidimensional Domains," Papers 2201.00496, arXiv.org, revised Oct 2022.
    7. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2010. "Individual versus group strategy-proofness: When do they coincide?," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1648-1674, September.
    8. Salvador Barbera & Matthew Jackson, 1991. "A Characterization of Strategy-Proof Social Choice Functions for Economies with Pure Public Goods," Discussion Papers 964, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. Block, Veronica, 2010. "Efficient and strategy-proof voting over connected coalitions: A possibility result," Economics Letters, Elsevier, vol. 108(1), pages 1-3, July.
    10. Le Breton, Michel & Weymark, John A., 1999. "Strategy-proof social choice with continuous separable preferences," Journal of Mathematical Economics, Elsevier, vol. 32(1), pages 47-85, August.
    11. Aziz, Haris & Chan, Hau & Lee, Barton E. & Parkes, David C., 2020. "The capacity constrained facility location problem," Games and Economic Behavior, Elsevier, vol. 124(C), pages 478-490.
    12. Lok, R.B. & Romero Morales, D. & Vermeulen, A.J., 2005. "The agents-are-substitutes property in continuous generalized assignment problems," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    13. Chatterji, Shurojit & Zeng, Huaxia, 2023. "A taxonomy of non-dictatorial unidimensional domains," Games and Economic Behavior, Elsevier, vol. 137(C), pages 228-269.
    14. Bossert, Walter & Sprumont, Yves, 2014. "Strategy-proof preference aggregation: Possibilities and characterizations," Games and Economic Behavior, Elsevier, vol. 85(C), pages 109-126.
    15. Alcalde-Unzu, Jorge & Vorsatz, Marc, 2018. "Strategy-proof location of public facilities," Games and Economic Behavior, Elsevier, vol. 112(C), pages 21-48.
    16. Haeringer, Guillaume & Hałaburda, Hanna, 2016. "Monotone strategyproofness," Games and Economic Behavior, Elsevier, vol. 98(C), pages 68-77.
    17. Shurojit Chatterji & Huaxia Zeng, 2023. "Decomposability and Strategy-proofness in Multidimensional Models," Papers 2303.10889, arXiv.org, revised Nov 2023.
    18. Bednay, Dezső & Moskalenko, Anna & Tasnádi, Attila, 2019. "Dictatorship versus manipulability," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 72-76.
    19. Tobias Rachidi, 2021. "Optimal Voting Mechanisms on Generalized Single-Peaked Domains," CRC TR 224 Discussion Paper Series crctr224_2020_214v2, University of Bonn and University of Mannheim, Germany.
    20. Chatterji, Shurojit & Roy, Souvik & Sadhukhan, Soumyarup & Sen, Arunava & Zeng, Huaxia, 2022. "Probabilistic fixed ballot rules and hybrid domains," Journal of Mathematical Economics, Elsevier, vol. 100(C).

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2606.04959. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.