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 a Stackelberg pricing problem in directed networks:Tariffs (prices) have to be defined by an operator, the leader, for a subset of the arcs. Clients, the followers, choose paths to route their demand through the network selfishly and independently of each other, on the basis of...

Many NP-complete graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find...

We consider a profit maximization problem when pricing a set of m items which can be represented as the edges of an undirected multi graph G. There is a set of n customers, each of which is interested in purchasing a bundle of edges of G, and we assume that these edges form a simple path in G....

This paper addresses two-dimensional trajectory optimization problems, where the mover''s speed monotonically decreases/increases in one of the space''s coordinates. For instance, it is well-known that the absolute value of the helicopter speed decreases in altitude because air pressure drops....

This paper studies the sales of a single indivisible object where bidders have continuous valuations. In Grigorieva et al. [13] it was shown that, in this setting, query auctions necessarily allocate inefficiently in equilibrium. In this paper we propose a new sequential auction, called the...

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...