IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v20y2023i1d10.1007_s10287-023-00476-w.html
   My bibliography  Save this article

Approximate variational inequalities and equilibria

Author

Listed:
  • Giancarlo Bigi

    (University of Pisa)

  • Lorenzo Lampariello

    (Roma Tre University)

  • Simone Sagratella

    (Sapienza University of Rome)

  • Valerio Giuseppe Sasso

    (Sapienza University of Rome)

Abstract

We study relations between the solution sets of Variational Inequalities, Minty Variational Inequalities, Natural Map problems and Nash Equilibrium Problems. Moreover, motivated by the inherent relevance of inexactness both in modeling non-cooperative games and in algorithms for variational inequalities, we consider inexact versions of such problems and we establish relations to quantify how inexactness propagates from one problem to the other.

Suggested Citation

  • Giancarlo Bigi & Lorenzo Lampariello & Simone Sagratella & Valerio Giuseppe Sasso, 2023. "Approximate variational inequalities and equilibria," Computational Management Science, Springer, vol. 20(1), pages 1-16, December.
  • Handle: RePEc:spr:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00476-w
    DOI: 10.1007/s10287-023-00476-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00476-w
    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/s10287-023-00476-w?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. Francisco Facchinei & Lorenzo Lampariello, 2011. "Partial penalization for the solution of generalized Nash equilibrium problems," Journal of Global Optimization, Springer, vol. 50(1), pages 39-57, May.
    2. Brânzei, R. & Morgan, J. & Scalzo, V. & Tijs, S.H., 2002. "Approximate Fixed Point Theorems in Banach Spaces with Applications in Game Theory," Discussion Paper 2002-17, Tilburg University, Center for Economic Research.
    3. Lorenzo Lampariello & Gianluca Priori & Simone Sagratella, 2022. "On the solution of monotone nested variational inequalities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 421-446, December.
    4. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    5. Lorenzo Lampariello & Christoph Neumann & Jacopo M. Ricci & Simone Sagratella & Oliver Stein, 2020. "An explicit Tikhonov algorithm for nested variational inequalities," Computational Optimization and Applications, Springer, vol. 77(2), pages 335-350, November.
    6. Sang Nguyen & Clermont Dupuis, 1984. "An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs," Transportation Science, INFORMS, vol. 18(2), pages 185-202, May.
    7. Lampariello, Lorenzo & Neumann, Christoph & Ricci, Jacopo M. & Sagratella, Simone & Stein, Oliver, 2021. "Equilibrium selection for multi-portfolio optimization," European Journal of Operational Research, Elsevier, vol. 295(1), pages 363-373.
    8. Jacqueline Morgan, 2005. "Approximations and Well-Posedness in Multicriteria Games," Annals of Operations Research, Springer, vol. 137(1), pages 257-268, July.
    9. Simone Sagratella, 2017. "Computing equilibria of Cournot oligopoly models with mixed-integer quantities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 549-565, December.
    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. Francesco Cesarone & Lorenzo Lampariello & Davide Merolla & Jacopo Maria Ricci & Simone Sagratella & Valerio Giuseppe Sasso, 2023. "A bilevel approach to ESG multi-portfolio selection," Computational Management Science, Springer, vol. 20(1), pages 1-23, December.
    2. Lampariello, Lorenzo & Neumann, Christoph & Ricci, Jacopo M. & Sagratella, Simone & Stein, Oliver, 2021. "Equilibrium selection for multi-portfolio optimization," European Journal of Operational Research, Elsevier, vol. 295(1), pages 363-373.
    3. Lorenzo Lampariello & Christoph Neumann & Jacopo M. Ricci & Simone Sagratella & Oliver Stein, 2020. "An explicit Tikhonov algorithm for nested variational inequalities," Computational Optimization and Applications, Springer, vol. 77(2), pages 335-350, November.
    4. Jiawang Nie & Xindong Tang & Lingling Xu, 2021. "The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials," Computational Optimization and Applications, Springer, vol. 78(2), pages 529-557, March.
    5. Cesarone, Francesco & Lampariello, Lorenzo & Sagratella, Simone, 2019. "A risk-gain dominance maximization approach to enhanced index tracking," Finance Research Letters, Elsevier, vol. 29(C), pages 231-238.
    6. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    7. Lorenzo Lampariello & Gianluca Priori & Simone Sagratella, 2022. "On the solution of monotone nested variational inequalities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 421-446, December.
    8. Lucia Pusillo, 2017. "Vector Games with Potential Function," Games, MDPI, vol. 8(4), pages 1-11, September.
    9. Sagratella, Simone & Schmidt, Marcel & Sudermann-Merx, Nathan, 2020. "The noncooperative fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 373-382.
    10. Lorenzo Lampariello & Simone Sagratella, 2020. "Numerically tractable optimistic bilevel problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 277-303, June.
    11. Lorenzo Lampariello & Simone Sagratella, 2015. "It is a matter of hierarchy: a Nash equilibrium problem perspective on bilevel programming," DIAG Technical Reports 2015-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    12. Lingyu Zhang & Li Wang & Lili Zhang & Xiao Zhang & Dehui Sun, 2023. "An RSU Deployment Scheme for Vehicle-Infrastructure Cooperated Autonomous Driving," Sustainability, MDPI, vol. 15(4), pages 1-16, February.
    13. D.R. Han & H.K. Lo, 2002. "New Alternating Direction Method for a Class of Nonlinear Variational Inequality Problems," Journal of Optimization Theory and Applications, Springer, vol. 112(3), pages 549-560, March.
    14. Ng, ManWo & Waller, S. Travis, 2010. "A computationally efficient methodology to characterize travel time reliability using the fast Fourier transform," Transportation Research Part B: Methodological, Elsevier, vol. 44(10), pages 1202-1219, December.
    15. Szeto, W. Y. & Lo, Hong K., 2004. "A cell-based simultaneous route and departure time choice model with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 593-612, August.
    16. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    17. Huang, Ruqing & Han, Lee D. & Huang, Zhongxiang, 2022. "A new network equilibrium flow model: User-equilibrium with quantity adjustment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    18. Lundgren, Jan T. & Peterson, Anders, 2008. "A heuristic for the bilevel origin-destination-matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 339-354, May.
    19. Ji, Xiangfeng & Chu, Yanyu, 2020. "A target-oriented bi-attribute user equilibrium model with travelers’ perception errors on the tolled traffic network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    20. Li, Tongfei & Xu, Min & Sun, Huijun & Xiong, Jie & Dou, Xueping, 2023. "Stochastic ridesharing equilibrium problem with compensation optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 170(C).

    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:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00476-w. 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.