Nedialko B. Dimitrov

Details der Publikationsliste

Zeitraum

2005 - 2009

Anzahl

7

Co-Autoren

Competitive Weighted Matching (2009)

In Transversal Matroids, Nedialko B. Dimitrov, C. Greg Plaxton

1 Introduction Motivated by applications related to auctions, mechanism design, and revenuemanagement, Babaioff et al. recently introduced a generalization of the secretary problem called the online...

Buyer-Supplier Games: Optimization Over the (2009)

Nedialko B. Dimitrov, C. Greg Plaxton

1 Introduction In this paper, we study the core of a large set of games, a subset of assignmentgames, which we term buyer-supplier games [3, 22] [23, Chapter 6]. We are primarily concerned with...

Warranty Optimization in a Dynamic Environment (2009)

Nedialko B. Dimitrov, Stefanka Chukova

A product warranty is an agreement offered by a producer to a consumer to replace or repair a faulty item, or to partially or fully reimburse the consumer in the event of a failure. Warranties are...

Warranty Optimization in a Dynamic Environment (2009)

Nedialko B. Dimitrov, Stefanka Chukova

A product warranty is an agreement offered by a producer to a consumer to replace or repair a faulty item, or to partially or fully reimburse the consumer in the event of a failure. Warranties are...

Buyer-Supplier Games: Optimization Over the (2008)

Nedialko B. Dimitrov, C. Greg Plaxton

Abstract. In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called suppliers,...

A Competitive, Primal-Dual Algorithm for Stable Coalitions in a Cluster (2007)

Nedialko B. Dimitrov, Indrajit Roy

In this paper we study the following Cluster Profit Problem. Highly parallelizable requests arrive on network nodes. Each request is associated with a tuple (g, r). The requester is willing to pay kg...

Optimal Cover Time for a Graph-Based Coupon Collector Process (2005)

Nedialko B. Dimitrov, C. Greg Plaxton

In this paper we study the following covering process defined over an arbitrary directed graph. Each node is initially uncovered and is assigned a random integer rank drawn from a suitable range. The...