Optimal cost sharing for capacitated facility location games

We consider cost sharing for a class of facility location games, where the strategy space of each player consists of the bases of a player-specific matroid defined on the set of resources. We assume that resources have nondecreasing load-dependent costs and player-specific delays. Our model includes the important special case of capacitated facility location problems, where players have to jointly pay for opened facilities. The goal is to design cost sharing protocols so as to minimize the resulting price of anarchy and price of stability. We investigate two classes of protocols: basic protocols guarantee the existence of at least one pure Nash equilibrium and separable protocols additionally require that the resulting cost shares only depend on the set of players on a resource. We find optimal basic and separable protocols that guarantee the price of stability/price of anarchy to grow logarithmically/linearly in the number of players. These results extend our previous results (cf. von Falkenhausen & Harks, 2013), where optimal basic and separable protocols were given for the case of symmetric matroid games without delays.     

关于群类的Sylow性质

群类理论是在有限可解群研究工作的基础上发展起来的,但近年来对有限群论的许多方面都起到越来越大的作用.在考察群类性质时,注意到一个Fitting类(?)在可解群G中的(?)内射子具有Sylow子群所具有的某些性质,并且关于Sylow定理中(Sy13),证明了对于群的本原子群,成立更强的结论.     

In response to the article by Maxim Kontsevich: Rozansky–Witten Invariants Via Formal Geometry

We show that recently constructed invariants of 3-dimensional manifolds and of hyperkähler manifolds (L. Rozansky and E. witten) come from characteristic classes of foliations and from Gelfand-fuks cohomology.     

A characterization of well-covered graphs in terms of prohibited costable subgraphs

A graph is calledwell-covered if all maximal independent subsets in it have the same number of elements. LetI be an independent subset (possibly empty) in a graphG. The subgraph ofG obtained by erasing the setI together with its neighborhood is calledcostable. We present a characterization of the class of well-covered graphs in terms of the minimal set of prohibited costable subgraphs. This characterization implies characterizations of some well-known subclasses of the class of well-covered graphs as well as the existence of a polynomial algorithm for the recognition of well-covered graphs with bounded valences. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 52–56, January, 2000.     

Minimizing the number of machines for minimum length schedules

In this paper, we present a new objective function for scheduling on parallel machines: minimizing the number of machines for schedules of minimum length. We study its complexity and we prove the NP-completeness of this problem, even if there is no precedences or for unitary execution times. We propose several polynomial algorithms for various particular cases.     

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

In an article Cheng (2009) [3] published recently in this journal, it was shown that when k≥3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is NP-hard. We consider the problem when k=2. In regards to the issue of solvability in polynomial time, we show that the problem is at least as hard as graph automorphism, but no harder than graph isomorphism.     

The convenient setting for quasianalytic Denjoy-Carleman differentiable mappings

For quasianalytic Denjoy-Carleman differentiable function classes CQ where the weight sequence Q=(Qk) is log-convex, stable under derivations, of moderate growth and also an L-intersection (see (1.6)), we prove the following: The category of CQ-mappings is cartesian closed in the sense that CQ(E,CQ(F,G))≅CQ(E×F,G) for convenient vector spaces. Applications to manifolds of mappings are given: The group of CQ-diffeomorphisms is a regular CQ-Lie group but not better.     

Breaks, cuts, and patterns

We generalize the concept of a break by considering pairs of arbitrary rounds. We show that a set of home-away patterns minimizing the number of generalized breaks cannot be found in polynomial time, unless P=NP. When all teams have the same break set, the decision version becomes easy; optimizing remains NP-hard.     

Characteristic classes of flat bundles, II

On a smooth varietyX defined over a fieldK of characteristic zero, one defines characteristic classes of bundles with an integrableK-connection in a group lifting the Chow group, which map, whenK is the field of complex numbers andX is proper, to Cheeger-Simons' secondary analytic invariants, compatibly with the cycle map in the Deligne cohomology.     

在Hp空间上的函数准解析类

对包含在Hp空间上的函数准解析类Hp(Mn)的准解析问题给出了解答,这个解答与经典的Denjoy-Carleman准解析和Mandelbrojt准解析问题的解答相类似.