Submodularity helps in Nash and nonsymmetric bargaining games

DOI10.1137/110821433MaRDI QIDQ4979826zbMATH OpenOpenAlexFDO

Authors Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Chang-Yuan Yu

Publication date 19 June 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/17731dc4094e3f0198d4b7ff201356ca49378b4d

zbMATH Keywords

convex programsNash bargainingsubmodularity

Mathematics Subject Classification ID

Convex programming (90C25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
• Efficiency, Fairness and Competitiveness in Nash Bargaining Games
• The Nash bargaining solution is optimal
• On the non-symmetric Nash and Kalai-Smorodinsky Bargaining Solutions
• Characterizing the Nash bargaining solution without Pareto-optimality

Cited in

(3)

• Efficiency, Fairness and Competitiveness in Nash Bargaining Games
• Online non-monotone diminishing return submodular maximization in the bandit setting
• Sharing the cost of the polluted river: a class of bilateral compensation methods

This page was built for publication: Submodularity helps in Nash and nonsymmetric bargaining games

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