In this paper we analyse limit pricing by an incumbent when faced by a multi-market entrant which can produce (subject to a constraint) in several markets simultaneously. We find that using three sizes of fixed costs, signalling occurs in even when entry cannot be deterred and that the limit...

This paper introduces new ejection chain strategies to effectively target vehicle routing problems with time window constraints (VRPTW). Ejection chain procedures are based on the idea of compound moves that allow a variable number of solution components to be modified within any single...

The Nearest Neighbor classifier has shown to be a powerful tool for multiclass classification. In this note we explore both theoretical properties and empirical behavior of a variant of such method, in which the Nearest Neighbor rule is applied after selecting a set of so-called prototypes,...

We consider the problem to price (digital) items in order to maximize the revenue obtainable from a set of bidders. We suggest a natural monotonicity constraint on bundle prices, show that the problem remains NP-hard, and we derive a PTAS. We also discuss a special case, the highway pricing problem.

We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU...

In this paper we analyse limit pricing by an incumbent when faced by a multi-market entrant which can produce (subject to a constraint) in several markets simultaneously. We find that using three sizes of fixed costs, signalling occurs in even when entry cannot be deterred and that the limit...

In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: it sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior or it...

We show that in the canonical non-cooperative multilateral bargaining game, a subgameperfect equilibrium exists in pure stationary strategies, even when the space of feasible payoffs is not convex. At such an equilibrium there is no delay. We also have the converse result that randomization will...

It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing...

To verify whether a transferable utility game is exact, one has to check a linear inequalityfor each exact balanced collection of coalitions. This paper studies the structure andproperties of the class of exact balanced collections. Comparing the definition of exactbalanced collections with the...