A strategy is obviously dominant if, for any deviation, at any information set where both
strategies first diverge, the best outcome under the deviation is no better than the worst …

The goal of fair division is to distribute resources among competing players in a “fair" way.
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …

Matching is a classic problem with a rich history and a significant impact, both on the theory
of algorithms and in practice. Recently there has been a surge of interest in the online …

Multimedia Internet-of-Things (IoT) systems have been widely used in surveillance,
automatic behavior analysis and event recognition, which integrate image processing …

Let f:2^X→\calR_+ be a monotone submodular set function, and let (X,\calI) be a matroid.
We consider the problem \rmmax_S∈\calIf(S). It is known that the greedy algorithm yields a …

There is often the need to update an installed intrusion detection system (IDS) due to new
attack methods or upgraded computing environments. Since many current IDSs are …

A theory of “discrete convex analysis” is developed for integer-valued functions defined on
integer lattice points. The theory parallels the ordinary convex analysis, covering discrete …

In this manuscript, we offer a gentle review of submodularity and supermodularity and their
properties. We offer a plethora of submodular definitions; a full description of a number of …

We develop a model of matching with contracts which incorporates, as special cases, the
college admissions problem, the Kelso-Crawford labor market matching model, and …

How does a search engine company decide what ads to display with each query so as to
maximize its revenue? This turns out to be a generalization of the online bipartite matching …