IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v114y2024ics0304406824001071.html
   My bibliography  Save this article

Bureaucracy in quest of feasibility

Author

Listed:
  • Crès, Hervé
  • Gilboa, Itzhak
  • Vieille, Nicolas

Abstract

A bureaucracy has to determine the values of many decision variables while satisfying a set of constraints. The bureaucracy is not assumed to have any objective function beyond achieving a feasible solution, which can be viewed as “satisficing” à la Simon (1955). We assume that the variables are integer-valued and the constraints are linear. We show that simple and (arguably) natural versions of the problem are already NP-Hard. We therefore look at decentralized decisions, where each office controls but one decision variable and can determine its value as a function of its past values. However, an attempt to consult more than a single past case can lead to Condorcet-style consistency problems. We prove an Arrovian result, showing that, under certain conditions, feasibility is guaranteed only if all offices mimic their decisions in the same past case. This result can be viewed as explaining a status quo bias.

Suggested Citation

  • Crès, Hervé & Gilboa, Itzhak & Vieille, Nicolas, 2024. "Bureaucracy in quest of feasibility," Journal of Mathematical Economics, Elsevier, vol. 114(C).
  • Handle: RePEc:eee:mateco:v:114:y:2024:i:c:s0304406824001071
    DOI: 10.1016/j.jmateco.2024.103047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406824001071
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jmateco.2024.103047?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:mateco:v:114:y:2024:i:c:s0304406824001071. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.