IDEAS home Printed from https://ideas.repec.org/p/isu/genres/5164.html
   My bibliography  Save this paper

Voting Over Efficient Decision Rules in Budget Balanced Organizations

Author

Listed:
  • Hueth, Brent
  • Melkonian, Tigran A.

Abstract

We examine the choice of efficient decision rules in a budget-balanced organization. The organization awards a scarce ``project'' to the organization member who values it most, and redistributes some surplus from the project among all remaining members. An auction-based allocation rule tends to generate majority support when the number of members in the organization is large, and when the ex ante distribution of member types is relatively symmetric. A decrease in the value of the project, or an increase in the the amount that is redistributed under the ``managerial allocation'' rule, increases support for this rule when the probability of intermediate types winning the auction is small relative to 1/n.

Suggested Citation

  • Hueth, Brent & Melkonian, Tigran A., 2003. "Voting Over Efficient Decision Rules in Budget Balanced Organizations," Staff General Research Papers Archive 5164, Iowa State University, Department of Economics.
  • Handle: RePEc:isu:genres:5164
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Holmstrom, Bengt & Myerson, Roger B, 1983. "Efficient and Durable Decision Rules with Incomplete Information," Econometrica, Econometric Society, vol. 51(6), pages 1799-1819, November.
    2. David P. Baron & David Besanko, 1999. "Informational Alliances," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 66(4), pages 743-768.
    3. Riley, John G & Samuelson, William F, 1981. "Optimal Auctions," American Economic Review, American Economic Association, vol. 71(3), pages 381-392, June.
    4. Semih Koray, 2000. "Self-Selective Social Choice Functions Verify Arrow and Gibbarad- Satterthwaite Theorems," Econometrica, Econometric Society, vol. 68(4), pages 981-996, July.
    5. McAfee, R Preston & McMillan, John, 1992. "Bidding Rings," American Economic Review, American Economic Association, vol. 82(3), pages 579-599, June.
      • McAfee, R. Preston & McMillan, John., 1990. "Bidding Rings," Working Papers 726, California Institute of Technology, Division of the Humanities and Social Sciences.
    6. Maskin, Eric S & Riley, John G, 1984. "Optimal Auctions with Risk Averse Buyers," Econometrica, Econometric Society, vol. 52(6), pages 1473-1518, November.
    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. Nicolas Gruyer, 2005. "Using lotteries in auctions when buyers collude," Economics Working Papers 02, LEEA (air transport economics laboratory), ENAC (french national civil aviation school).
    2. Cantillon, Estelle, 2008. "The effect of bidders' asymmetries on expected revenue in auctions," Games and Economic Behavior, Elsevier, vol. 62(1), pages 1-25, January.
    3. Bartling, Björn & Netzer, Nick, 2016. "An externality-robust auction: Theory and experimental evidence," Games and Economic Behavior, Elsevier, vol. 97(C), pages 186-204.
    4. Roberto Burguet, 2000. "Auction theory: a guided tour," Investigaciones Economicas, Fundación SEPI, vol. 24(1), pages 3-50, January.
    5. Rachmilevitch, Shiran, 2013. "Endogenous bid rotation in repeated auctions," Journal of Economic Theory, Elsevier, vol. 148(4), pages 1714-1725.
    6. Lorentziadis, Panos L., 2012. "Optimal bidding in auctions of mixed populations of bidders," European Journal of Operational Research, Elsevier, vol. 217(3), pages 653-663.
    7. Llorente-Saguer, Aniol & Zultan, Ro’i, 2017. "Collusion and information revelation in auctions," European Economic Review, Elsevier, vol. 95(C), pages 84-102.
    8. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    9. Nicolas Gruyer, 2008. "Optimal Auctions when a seller is bound to sell to collusive bidders (new version of "using lotteries ...")," Economics Working Papers 06, LEEA (air transport economics laboratory), ENAC (french national civil aviation school).
    10. Peters, Michael & Severinov, Sergei, 1997. "Competition among Sellers Who Offer Auctions Instead of Prices," Journal of Economic Theory, Elsevier, vol. 75(1), pages 141-179, July.
    11. Kang, Chao-Chung & Lee, Tsun-Siou & Huang, Szu-Chi, 2013. "Royalty bargaining in Public–Private Partnership projects: Insights from a theoretic three-stage game auction model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 59(C), pages 1-14.
    12. Jean-Jacques Laffont, 1998. "Théorie des jeux et économie empirique : le cas des données issues d'enchères," Économie et Prévision, Programme National Persée, vol. 132(1), pages 121-137.
    13. Ledyard, John O. & Palfrey, Thomas R., 2007. "A general characterization of interim efficient mechanisms for independent linear environments," Journal of Economic Theory, Elsevier, vol. 133(1), pages 441-466, March.
    14. Baisa, Brian, 2017. "Auction design without quasilinear preferences," Theoretical Economics, Econometric Society, vol. 12(1), January.
    15. Skrzypacz, Andrzej & Hopenhayn, Hugo, 2004. "Tacit collusion in repeated auctions," Journal of Economic Theory, Elsevier, vol. 114(1), pages 153-169, January.
    16. Laffont, Jean-Jacques, 1997. "Game theory and empirical economics: The case of auction data 1," European Economic Review, Elsevier, vol. 41(1), pages 1-35, January.
    17. Domenico Menicucci, 1998. "Optimal auctions under collusion of buyers with discrete valuations," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 21(1), pages 49-71, June.
    18. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    19. Paul Belleflamme & Francis Bloch, 2004. "Market sharing agreements and collusive networks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(2), pages 387-411, May.
    20. Shunda, Nicholas, 2009. "Auctions with a buy price: The case of reference-dependent preferences," Games and Economic Behavior, Elsevier, vol. 67(2), pages 645-664, November.

    More about this item

    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:isu:genres:5164. 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: Curtis Balmer (email available below). General contact details of provider: https://edirc.repec.org/data/deiasus.html .

    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.