The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...