On online platforms, consumers face an abundance of options that are displayed in the form a position ranking. Only products placed first few positions readily accessible to consumer, and she needs exert effort access more options. For such we develop two-stage sequential search model where, stage, consumer sequentially screens observe preference weight them forms consideration set. In second observes additional idiosyncratic utility can derive from each product chooses highest-utility...

This study was aimed at optimizing the extraction process of phenolic compounds, particularly antioxidants and antimicrobial agents, from apple pomace using subcritical water method. The Box–Behnken experimental design utilized to ascertain optimal conditions, focusing on maximizing yield, compound content, antioxidant activity. Three independent variables were investigated: temperature (120°C, 140°C, 160°C), time (20, 30, 40 min), water‐to‐apple ratio (1:20, 1:40, 1:60 g/mL). optimized...

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale parallel computation frameworks and has recently gained lot importance, especially in the context classic graph problems. In this work, we mainly consider maximal matching independent set problems MPC model.

We present the first algorithm for maintaining a maximal independent set (MIS) of fully dynamic graph-which undergoes both edge insertions and deletions-in polylogarithmic time. Our is randomized and, per update, takes O(log <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> Δ log n) expected Furthermore, can be adjusted to have xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> worst-case update-time with high probability. Here, n denotes...

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields.The winner of each battlefield is determined independently a winner-take-all rule. The ultimate payoff colonel number battlefields he wins. This game commonly used for analyzing wide range applications such as U.S presidential election, innovative technology competitions, advertisements, etc. There have been persistent efforts finding...

In this paper, we study max-weight stochastic matchings on online bipartite graphs under both vertex and edge arrivals. We focus designing polynomial time approximation algorithms with respect to the benchmark, which was first considered by Papadimitriou, Pollner, Saberi, Wajc [EC'21].

The success of modern parallel paradigms such as MapReduce, Hadoop, or Spark, has attracted a significant attention to the Massively Parallel Computation (MPC) model over past few years, especially on graph problems. In this work, we consider symmetry breaking problems maximal independent set (MIS) and matching (MM), which are among most intensively studied in distributed/parallel computing, MPC. These known admit efficient MPC algorithms if space per machine is near-linear $n$, number...

The Colonel Blotto game, first introduced by Borel in 1921, is a well-studied game theory classic. Two colonels each have pool of troops that they divide simultaneously among set battlefields. winner battlefield the colonel who puts more it and overall utility sum weights battlefields s/he wins. Over past century, has found applications many different forms competition from advertisements to politics sports.

We study the problem of computing personalized reserve prices in eager second price auctions without having any assumption on valuation distributions. Here, input is a dataset that contains submitted bids n buyers set and goal to return r maximize revenue earned these by running with r. present novel LP formulation this rounding procedure which achieves (1+2(√2-1)e√2-2)-1≅0.684-approximation. This improves over 1/2-approximation Algorithm due Roughgarden Wang. show our analysis tight for...

Suppose that we are given an arbitrary graph G=(V, E) and know each edge in E is going to be realized independently with some probability p. The goal the stochastic matching problem pick a sparse subgraph Q of G such edges Q, expectation, include approximately as large maximum among G. degree can depend on p, but not size This has been subject extensive studies over years approximation factor improved gradually from 0.5 eventually 2/3 which known barrier. In this work, analyze natural...

On online platforms, consumers face an abundance of options that are displayed in the form a position ranking. Only products placed first few positions readily accessible to consumer, and she needs exert effort access more options. For such we develop two-stage sequential search model where stage, consumer sequentially screens observe preference weight them forms consideration set. In second observes additional idiosyncratic utility can derive from each product chooses highest-utility within...

We study the problem of computing data-driven personalized reserve prices in eager second price auctions without having any assumption on valuation distributions. Here, input is a data set that contains submitted bids n buyers auctions, and to return r maximize revenue earned these by running with r. For this problem, which known be NP complete, we present novel linear program (LP) formulation rounding procedure, achieves 0.684 approximation. This improves over [Formula: see...

In this paper we consider the maximum matching problem in large bipartite graphs. We present a new algorithm that finds few iterations of novel edge sampling technique. This can be implemented big data settings such as streaming setting and MapReduce setting, where each iteration maps to one pass over stream, or round computation, respectively. prove our provides 1-\eps approximate solution 1/\eps rounds which improves prior work terms number passes/rounds. Our works even better when run it...

Graph problems are troublesome when it comes to MapReduce. Typically, be able design algorithms that make use of the advantages MapReduce, assumptions beyond what model imposes, such as density input graph, required. In a recent shift, simple and robust MapReduce for graph problems, where space per machine is set O(|V|), has attracted considerable attention. We term this semi-MapReduce, or in short, semiMPC, focus on its computational power. show through simulation methods semiMPC is,...

On online platforms, consumers face an abundance of options that are displayed in the form a position ranking. Only products placed first few positions readily accessible to consumer, and she needs exert effort access more options. For such we develop two-stage sequential search model where stage, consumer sequentially screens observe preference weight them forms consideration set. In second observes additional idiosyncratic utility can derive from each product chooses highest-utility within...

An ever-important issue is protecting infrastructure and other valuable targets from a range of threats vandalism to theft piracy terrorism. The "defender" can rarely afford the needed resources for 100% protection. Thus, key question is, how provide best protection using limited available resources.

Protecting valuable \em targets from an adversary is ever-important international concern with far-reaching applications in wildlife protection, border counter-terrorism, protection of ships piracy, etc. As a successful recent approach, security games cast these issues as two-player between defender and attacker. The decides on how to allocate the available resources protect against attacker who strives inflict damage them. main question interest here equilibrium computation. Our focus this...

Solving large-scale graph problems is a fundamental task in many real-world applications, and it an increasingly important problem data analysis. Despite the large effort designing scalable algorithms, classic lack algorithms that require only sublinear number of machines space input size. Specifically when sparse, which indeed case for graphs, becomes impossible to store access all vertices one machine - something often taken granted massive graphs. The theoretical model we consider...