Naohisa Kabutoya

Learn More
This paper studies the complexity of computing solution concepts for a cooperative game, called the minimum base game (MBG) (E; c), where its characteristic function c : 2 E 7! < is de ned as c(S) = (the weight w(B) of a minimum weighted base B S), for a given matroid M = (E;I) and a weight functionw : E 7! <. The minimum base game contains, as a special(More)
  • 1