We study the Online Steiner Tree Leasing (OSTL) problem, defined in a weighted undirected graph with a distinguished root node r. There is a known set L of available lease types, where each type ` ∈ L is characterized by its duration D` and cost factor C`. As an input, an online algorithm is given a sequence of terminals and has to connect them to the root r using leased edges. An edge of lengt...

1 Extensions of the Multiplicative Weights Guarantee Last lecture we introduced the multiplicative weights algorithm for online decision-making. You don't need to remember the algorithm details for this lecture, but you should remember that it's a simple and natural algorithm (just one simple update per action per time step). You should also remember its regret guarantee, which we proved last l...

e-commerce has made life simple and innovative of individuals and groups consumer behavior in online shopping is different from the physical market where he has access to see the product. the purpose of the research was to study the consumer behavior in online shopping of electronics especially in iran. primary data was collected through the questionnaire survey and by emails from personal cont...

A covering integer program (CIP) is a mathematical program of the form: min{cx | Ax ≥ 1, 0 ≤ x ≤ u, x ∈ Z}, where A ∈ R ≥0 , c, u ∈ R n ≥0. In the online setting, the constraints (i.e., the rows of the constraint matrix A) arrive over time, and the algorithm can only increase the coordinates of x to maintain feasibility. As an intermediate step, we consider solving the covering linear program (...

the debate over the contribution of the internet to democracy is farfrom settled. some point to the empowering effects of online discussionand fund raising on recent electoral campaigns in the us to argue thatthe internet will restore the public sphere. others claim that the internetis just a virtual mall, a final extension of global capitalism into everycorner of our lives. this paper argues f...

Following Mettu and Plaxton [15, 16], we study online algorithms for the k-medians problem. Such an algorithm must produce an incremental sequence F1 ⊆ F2 ⊆ · · · ⊆ Fn ⊆ F of sets of facilities. Mettu and Plaxton show that online metric medians has a (roughly) 40-competitive deterministic polynomial-time algorithm. We give improved algorithms, including a (24 + ǫ)competitive deterministic polyn...