Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-019-00435-9
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
- Umang Bhaskar & Lisa Fleischer & Darrell Hoy & Chien-Chung Huang, 2015. "On the Uniqueness of Equilibrium in Atomic Splittable Routing Games," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 634-654, March.
- Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
- Tobias Harks & Veerle Timmermans, 2018. "Uniqueness of equilibria in atomic splittable polymatroid congestion games," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 812-830, October.
- Kazuo Murota & Akiyoshi Shioura, 1999. "M-Convex Function on Generalized Polymatroid," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 95-105, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Fuga Kiyosue & Kenjiro Takazawa, 2024. "A common generalization of budget games and congestion games," Journal of Combinatorial Optimization, Springer, vol. 48(3), 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.- Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
- Cheng Wan, 2016. "Strategic decentralization in binary choice composite congestion games," Post-Print hal-02885837, HAL.
- Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
- Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
- Elizabeth Baldwin & Paul W. Goldberg & Paul Klemperer & Edwin Lock, 2019.
"Solving Strong-Substitutes Product-Mix Auctions,"
Economics Papers
2019-W08, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul & Baldwin, Elizabeth & Goldberg, Paul & Lock, Edwin, 2020. "Solving Strong-Substitutes Product-Mix Auctions," CEPR Discussion Papers 14976, C.E.P.R. Discussion Papers.
- Kazuo Murota, 2018. "Multiple Exchange Property for M ♮ -Concave Functions and Valuated Matroids," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 781-788, August.
- Satoru Fujishige & Michel X. Goemans & Tobias Harks & Britta Peis & Rico Zenklusen, 2017. "Matroids Are Immune to Braess’ Paradox," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 745-761, August.
- Huang, Chao, 2018. "Independence systems in gross-substitute valuations," Economics Letters, Elsevier, vol. 173(C), pages 135-137.
- Samson Alva & Battal Dou{g}an, 2021. "Choice and Market Design," Papers 2110.15446, arXiv.org, revised Nov 2021.
- Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
- Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
- Raimondo, Roberto, 2020. "Pathwise smooth splittable congestion games and inefficiency," Journal of Mathematical Economics, Elsevier, vol. 86(C), pages 15-23.
- Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.
- Ozan Candogan & Markos Epitropou & Rakesh V. Vohra, 2021. "Competitive Equilibrium and Trading Networks: A Network Flow Approach," Operations Research, INFORMS, vol. 69(1), pages 114-147, January.
- Satoru Fujishige & Akihisa Tamura, 2007. "A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 136-155, February.
- Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
- Elizabeth Baldwin & Paul Klemperer, 2019.
"Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities,"
Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
- Elizabeth Baldwin & Paul Klemperer, 2015. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium with Indivisibilities," Economics Papers 2015-W10, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul & Baldwin, Elizabeth, 2019. "Understanding Preferences: "Demand Types", and the Existence of Equilibrium with Indivisibilities," CEPR Discussion Papers 13586, C.E.P.R. Discussion Papers.
- Baldwin, Elizabeth & Klemperer, Paul, 2016. "Understanding preferences: "demand types", and the existence of equilibrium with indivisibilities," LSE Research Online Documents on Economics 63198, London School of Economics and Political Science, LSE Library.
- Sylvain Sorin & Cheng Wan, 2013. "Delegation equilibrium payoffs in integer-splitting games," Post-Print hal-02885954, HAL.
- Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
- Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
More about this item
Keywords
Matroid congestion game; Resource buying game; Pure Nash equilibrium; Monotone set function; Submodular function; $${mathrm {M}}^natural $$ M ♮ -convex function;All these keywords.
Statistics
Access and download statisticsCorrections
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:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00435-9. 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.