IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v19y2021i2d10.1007_s10288-021-00477-y.html
   My bibliography  Save this article

The trouble with the second quantifier

Author

Listed:
  • Gerhard J. Woeginger

    (RWTH Aachen)

Abstract

We survey optimization problems that allow natural simple formulations with one existential and one universal quantifier. We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples. We discuss the connections to robust optimization and to bilevel optimization, and we explain the reasons why the operational research community should be interested in the theoretical aspects of this area.

Suggested Citation

  • Gerhard J. Woeginger, 2021. "The trouble with the second quantifier," 4OR, Springer, vol. 19(2), pages 157-181, June.
    • Handle: RePEc:spr:aqjoor:v:19:y:2021:i:2:d:10.1007_s10288-021-00477-y
    DOI: 10.1007/s10288-021-00477-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-021-00477-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-021-00477-y?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.

    References listed on IDEAS

    as
    1. Deineko, Vladimir G. & Woeginger, Gerhard J., 2006. "On the dimension of simple monotonic games," European Journal of Operational Research, Elsevier, vol. 170(1), pages 315-318, April.
    2. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2017. "A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs," Operations Research, INFORMS, vol. 65(6), pages 1615-1637, December.
    3. Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001. "Core in a simple coalition formation game," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(1), pages 135-153.
    4. Alberto Caprara & Margarida Carvalho & Andrea Lodi & Gerhard J. Woeginger, 2016. "Bilevel Knapsack with Interdiction Constraints," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 319-333, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Carvalho, Margarida & Lodi, Andrea & Pedroso, João.P., 2022. "Computing equilibria for integer programming games," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1057-1070.
    2. T’kindt, Vincent & Della Croce, Federico & Agnetis, Alessandro, 2024. "Single machine adversarial bilevel scheduling problems," European Journal of Operational Research, Elsevier, vol. 315(1), pages 63-72.
    3. Blom, Danny & Smeulders, Bart & Spieksma, Frits, 2024. "Rejection-proof mechanisms for multi-agent kidney exchange," Games and Economic Behavior, Elsevier, vol. 143(C), pages 25-50.
    4. Stefan Napel & Dominik Welter, 2021. "Simple Voting Games and Cartel Damage Proportioning," Games, MDPI, vol. 12(4), pages 1-18, October.

    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. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    2. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
    3. Fischetti, Matteo & Monaci, Michele & Sinnl, Markus, 2018. "A dynamic reformulation heuristic for Generalized Interdiction Problems," European Journal of Operational Research, Elsevier, vol. 267(1), pages 40-51.
    4. Leitner, Markus & Ljubić, Ivana & Monaci, Michele & Sinnl, Markus & Tanınmış, Kübra, 2023. "An exact method for binary fortification games," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1026-1039.
    5. Furini, Fabio & Ljubić, Ivana & Martin, Sébastien & San Segundo, Pablo, 2019. "The maximum clique interdiction problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 112-127.
    6. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
    7. Thomas Kleinert & Martin Schmidt, 2021. "Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 198-215, January.
    8. Andrea Baggio & Margarida Carvalho & Andrea Lodi & Andrea Tramontani, 2021. "Multilevel Approaches for the Critical Node Problem," Operations Research, INFORMS, vol. 69(2), pages 486-508, March.
    9. Liu, Shaonan & Wang, Mingzheng & Kong, Nan & Hu, Xiangpei, 2021. "An enhanced branch-and-bound algorithm for bilevel integer linear programming," European Journal of Operational Research, Elsevier, vol. 291(2), pages 661-679.
    10. Emiliya Lazarova & Dinko Dimitrov, 2013. "Status-seeking in hedonic games with heterogeneous players," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(4), pages 1205-1229, April.
    11. Frits Hof & Walter Kern & Sascha Kurz & Kanstantsin Pashkovich & Daniël Paulusma, 2020. "Simple games versus weighted voting games: bounding the critical threshold value," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 609-621, April.
    12. Milchtaich, Igal & Winter, Eyal, 2002. "Stability and Segregation in Group Formation," Games and Economic Behavior, Elsevier, vol. 38(2), pages 318-346, February.
    13. Dimitrov, Dinko & Haake, Claus-Jochen, 2011. "Coalition formation in simple Games. the semistrict core," Center for Mathematical Economics Working Papers 378, Center for Mathematical Economics, Bielefeld University.
    14. Bloch, Francis & van den Nouweland, Anne, 2020. "Farsighted stability with heterogeneous expectations," Games and Economic Behavior, Elsevier, vol. 121(C), pages 32-54.
    15. Barbera, S. & Bossert, W. & Pattanaik, P.K., 2001. "Ranking Sets of Objects," Cahiers de recherche 2001-02, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    16. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    17. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    18. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    19. Oihane Gallo & Bettina Klaus, 2022. "Stable partitions for proportional generalized claims problems," Cahiers de Recherches Economiques du Département d'économie 22.03, Université de Lausanne, Faculté des HEC, Département d’économie.
    20. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.

    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:spr:aqjoor:v:19:y:2021:i:2:d:10.1007_s10288-021-00477-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.