摘要
In many kinds of games with economic significance,it is very important to study the submodularity of functions.In this paper,wemainly study the problem of maximizing a concave function over an intersection of two matroids.We obtain that the submod-ularity may not be preserved,but it involves one maximal submodular problem(or minimal supermodular problem)with some conditions.Moreover,we also present examples showing that these conditions can be satisfied.
基金
supported by Higher Educational Science and Technology Program of Shandong Province(No.J17KA171)
Natural Science and Engineering Research Council of Canada(No.06446)
the National Natural Science Foundation of China(No.11871081)
Science and Technology Program of Beijing Education Commission(No.KM201810005006).
