Buyer-supplier games: optimization over the core

DOI10.1016/j.tcs.2009.05.017zbMath1237.91113OpenAlexW6673975MaRDI QIDQ627118

Nedialko B. Dimitrov, C. Greg Plaxton

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.017

zbMATH Keywords

coreseparation oracleassignment gamefocus point price

Mathematics Subject Classification ID

Cooperative games (91A12) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the core of ordered submodular cost games
• The package assignment model.
• Bounding the inefficiency of equilibria in nonatomic congestion games
• The assignment game. I: The core
• How bad is selfish routing?
• On the complexity of equilibria
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Cooperative facility location games
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Algorithms, games, and the internet