Time-efficient algorithms for Nash-bargaining-based matching market models

DOI10.1007/978-3-032-08560-3_7MaRDI QIDQ7285565zbMATH OpenFDO

Authors Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani

Publication date 19 June 2026

Full work available at URL https://doi.org/10.1007/978-3-032-08560-3_7

Mathematics Subject Classification ID

Internet topics (68M11) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
• A Truthful Cardinal Mechanism for One-Sided Matching
• Algorithms for convex optimization
• Approximate efficiency in matching markets
• Approximating the Nash Social Welfare with Indivisible Items
• Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets
• Fractional covers for forests and matchings
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• scientific article; zbMATH DE number 7829318 (Why is no real title available?)
• Microeconomic theory
• The multiplicative weights update method: a meta-algorithm and applications
• The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
• Two-Person Cooperative Games

This page was built for publication: Time-efficient algorithms for Nash-bargaining-based matching market models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285565)