2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties

DOI10.1007/978-3-642-16170-4_28zbMath1310.91008arXiv0908.1181OpenAlexW3122615907MaRDI QIDQ3162530

Vijay V. Vazirani

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.1181

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) 2-person games (91A05) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (7)

Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics ⋮ Perfect forests in graphs and their extensions ⋮ Rectangular spiral galaxies are still hard ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Optimality bounds for a variational relaxation of the image partitioning problem ⋮ Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eisenberg-Gale markets: algorithms and game-theoretic properties
• Nonsymmetric Nash solutions and replications of 2-person bargaining
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• The Bargaining Problem
• On the Complexity of Nash Equilibria and Other Fixed Points
• A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It
• Spending Constraint Utilities with Applications to the Adwords Market
• Market equilibrium via a primal--dual algorithm for a convex program
• Settling the complexity of computing two-player Nash equilibria
• Nash Bargaining Via Flexible Budget Markets
• Equilibrium points in n -person games

This page was built for publication: 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties