Proposes a framework for fairness in two-sided marketplaces.
problem Achieving fairness in two-sided marketplaces.
method Developed an end-to-end framework for fairness constraints from both sides of the marketplace, including dynamic aspects.
result Efficacy of the proposed framework demonstrated through simulations.
This paper presents approaches to determine a network based pricing for 3D printing services in the context of a two-sided manufacturing-as-a-service marketplace. The intent is to provide cost analytics to enable service bureaus to better compete in the market by moving away from setting ad-hoc and subjective prices. A…
Two-sided marketplaces such as eBay, Etsy and Taobao have two distinct groups of customers: buyers who use the platform to seek the most relevant and interesting item to purchase and sellers who view the same platform as a tool to reach out to their audience and grow their business. Additionally, platforms have their o…
A new framework uses multi-agent reinforcement learning for evaluating policies in two-sided markets.
problem Evaluating the effects of different policies in two-sided markets with spatial and temporal interference.
method Introduces a multi-agent reinforcement learning (MARL) framework to address policy evaluation challenges in large-scale fleet management.
result Proposes novel estimators for mean outcomes under different products that are consistent despite high-dimensionality.
Framework for optimizing search engine rankings using observational data.
problem Optimizing ranking policies for search engines using limited observational data.
method Formulated expected reward optimization problem, estimated context value distribution, trained ranking policy via Bayesian inference.
result Demonstrated trade-offs in ranking policies trained on empirical reward estimates.
New estimator reduces bias in interference studies on content marketplaces.
problem Interference bias in experiments on content marketplaces like Douyin.
method Developed a Monte-Carlo estimator based on DQ techniques.
result Achieved bias second-order in treatment effect with low variance.
MARS-Gym framework for marketplaces to train and evaluate recommender systems.
problem Challenges in designing, training, and evaluating recommender systems in marketplaces.
method Open-source framework for Reinforcement Learning agents in marketplaces.
result Empowers researchers and engineers to quickly build and evaluate agents for recommendations.
A scalable system detects price anomalies in online marketplaces to improve customer experience.
problem Inaccurate prices on online marketplaces lead to poor customer experience and revenue loss.
method MoatPlus uses unsupervised statistical features and an ensemble of models to generate upper price bounds.
result Our approach improves precise anchor coverage by up to 46.6% in high-vulnerability item subsets.
Recommendations are broadly used in marketplaces to match users with items relevant to their interests and needs. To understand user intent and tailor recommendations to their needs, we use deep learning to explore various heterogeneous data available in marketplaces. This paper focuses on the challenge of measuring re…
Recommendation algorithms are widely adopted in marketplaces to help users find the items they are looking for. The sparsity of the items by user matrix and the cold-start issue in marketplaces pose challenges for the off-the-shelf matrix factorization based recommender systems. To understand user intent and tailor rec…
Optimizes bidding strategies for LinkedIn ads across multiple platforms.
problem Optimizing automated bidding agents for dynamic online marketplaces.
method Developed a general optimization framework for buyer's interest, agnostic to auction mechanisms.
result Automatically guarantees the optimality of budget allocation across ad units and platforms.
Uber optimizes marketplace levers using machine learning to improve resource allocation efficiency.
problem Optimizing budget allocation for drivers and riders to maximize business value.
method End-to-end machine learning and optimization procedure using feature store, model training, and ADMM.
result Substantially improved Uber's resource allocation efficiency through high-dimensional optimization.
Study fair team formation in online labor marketplaces.
problem Design fair algorithms for team formation in online labor marketplaces.
method Define and analyze the Fair Team Formation problem, provide inapproximability results, and develop four algorithms.
result Developed four algorithms for fair team formation in online labor marketplaces.
GCF estimates heterogeneous treatment effects for continuous treatments in online marketplaces.
problem Estimating heterogeneous treatment effects for continuous treatments in online marketplaces.
method Kernel-based doubly robust estimator and distance-based splitting criterion.
result GCF estimates heterogeneous treatment effects for continuous treatments effectively.
New algorithms learn stable matchings from uncertain user preferences.
problem Learning stable matchings from uncertain user preferences.
method Stochastic multi-armed bandit problem, incentive-aware learning objective, primal-dual formulation.
result Near-optimal regret bounds for learning stable matchings.
Proposes a new IPW-based ranking metric for two-sided markets.
problem Addressing bias in implicit user feedback in two-sided markets.
method Extends IPW estimator to two-sided markets, addressing position bias.
result Proposed estimator is unbiased for ground-truth ranking metric.
This paper introduces a reinforcement learning framework for A/B testing with dynamic causal effects.
problem Challenges in online experiments with sequential treatments and long-term impacts.
method Reinforcement learning framework for sequential monitoring and updating.
result Demonstrates improved treatment effect evaluation over current methods.
NFTs revolutionize art sales by providing proof of ownership.
problem Lack of provenance and authenticity in digital art.
method Analysis of major art NFT marketplaces.
result NFTs reduce the need for intermediaries in the art trade.
A new mechanism optimizes data marketplace pricing efficiently.
problem Designing fair and efficient pricing mechanisms for data marketplaces.
method Two-stage approach: auctions to estimate value distributions, then optimal posted prices.
result MAPP achieves optimal revenue with minimal price discrimination.
In this paper, we propose an offline counterfactual policy estimation framework called Genie to optimize Sponsored Search Marketplace. Genie employs an open box simulation engine with click calibration model to compute the KPI impact of any modification to the system. From the experimental results on Bing traffic, we s…
Study fairness in intervention to maximize outcomes.
problem Fairness in intervention on a given node.
method Counterfactual estimation with partial causal model knowledge.
result Theoretical guarantees on error probability and effectiveness of algorithm.
We establish two-sided bounds for the complexity of two infinite series of closed orientable 3-dimensional hyperbolic manifolds, the Lobell manifolds and the Fibonacci manifolds.
Optimizes Airbnb pricing to increase revenue and reduce booking regret.
problem Maximizing revenue in an online marketplace with competing products.
method Two-stage model to price retrieved items based on learned distributions of their values.
result Improves revenue and booking regret by at least +20% and +55% respectively.
Algorithm identifies optimal stable matching in uncertain two-sided markets.
problem Sequential learning in two-sided markets with unknown preferences.
method Pure exploration approach with elimination-based algorithms exploiting partial preference information.
result Identification of pervasive stable matching for optimal stable matching identification.
We define a notion of Hempel distance for one-sided Heegaard splittings and show that the existence of alternate surfaces restricts distance for one-sided splittings in a manner similar to Hartshorn's and Scharlemann-Tomova's results for two-sided splittings. We also show that every geometrically compressible one-sided…
The study examines stable minimal hypersurfaces in higher dimensions.
problem Characterizing stable minimal hypersurfaces in Rn+1. method Analyzing volume growth and stability conditions.
result Conditions for complete two-sided δ-stable minimal hypersurfaces to be the hyperplane. Discuss folklore statements about manifolds with curvature bounds.
problem Distance functions in manifolds with curvature bounds.
method Regularity, subsets of positive reach, and cut locus.
result Folklore statements about manifolds with curvature bounds are discussed.
Suppliers (including companies and individual prosumers) may wish to protect their private information when selling items they have in stock. A market is envisaged where private information can be protected through the use of differential privacy and option contracts, while privacy-aware suppliers deliver their stock a…
A new dataset tracks user interactions and click responses in online marketplaces.
problem Lack of exposure data in recommender systems datasets.
method Proposes a novel dataset including slates and click responses, allowing more accurate likelihood models.
result Models using exposure data show more natural likelihood, reducing bias towards previously exposed items.
New heat kernel bounds on manifolds with non-negative Ricci curvature.
problem Establishing new two-sided Gaussian bounds for heat kernels on manifolds.
method Using the non-negative Ricci curvature condition, derive new bounds for the heat kernel.
result Improved two-sided Gaussian bounds for the heat kernel on manifolds with non-negative Ricci curvature.
The realized GARCH framework is extended to incorporate the two-sided Weibull distribution, for the purpose of volatility and tail risk forecasting in a financial time series. Further, the realized range, as a competitor for realized variance or daily returns, is employed in the realized GARCH framework. Further, sub-s…
We obtain a finite generating set for the level 2 twist subgroup of the mapping class group of a closed non-orientable surface. The generating set consists of crosscap pushing maps along non-separating two-sided simple loops and squares of Dehn twists along non-separating two-sided simple closed curves. We also prove t…
Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…
Study uses RL to optimize crypto portfolios with two-sided transactions and lending.
problem Managing downside risk and capital optimization in high-risk crypto markets.
method Integrates RL with a new environmental formulation and PnL-based reward function, using SAC agent with CNN-MHA.
result Significantly outperforms benchmarks, especially in high-volatility scenarios.
A new algorithm for competing agents in a two-sided market setting.
problem Decentralized competition between agents in a two-sided market with unknown valuations.
method UCB-D3 algorithm for UCB with Decentralized Dominant-arm Deletion.
result UCB-D3 is order optimal and achieves a new regret lower bound.
A method for rank verification in multivariate Gaussian data, improving on existing approaches.
problem Determining the top K means in multivariate Gaussian data with any covariance structure. method Selective inference tools to generalize the two-sided difference-of-means test for any K and covariance structure. result The method provides a generalization for rank verification in multivariate Gaussian data with any covariance structure.
Market incentivizes parties to share high-quality data for collaborative machine learning tasks.
problem Fair revenue distribution and data replication threats in collaborative machine learning markets.
method Introduces a novel payment division function robust to replication and customized output models.
result Validated assumptions and showed approximate satisfaction for commonly used models.
Perimeter minimizers in curved spaces have a singular set no more than 5 dimensions.
problem Understanding the structure of minimizers in spaces with bounded Ricci curvature.
method Analysis of non-collapsed Ricci limit spaces with two-sided curvature bounds.
result The Hausdorff dimension of the singular set is at most \(N-5\).
Sharp bound on singular set dimension for specific geometric problems.
problem Hausdorff dimension of singular set in free boundary problems.
method Analysis of noncollapsed limits of manifolds with Ricci curvature bounds.
result Dimension bound of singular set is n−5. Let N be a compact, connected, nonorientable surface of genus g with n boundary components with g≥5, n≥0. Let T(N) be the two-sided curve complex of N. If λ:T(N)→T(N) is a superinjective simplicial map, then there exists a homeomorphism $h : N \rightar…
We show that for an immersed two-sided minimal surface in R3, there is a lower bound on the index depending on the genus and number of ends. Using this, we show the nonexistence of an embedded minimal surface in R3 of index 2, as conjectured by Choe. Moreover, we show that the index of a immersed two-sided mini…
Constructs tail-specific prediction intervals for financial applications
problem Financial applications require strict control on the left tail
method Extends classical conformal frameworks to provide explicit tail-specific guarantees
result Improved directional calibration in skewed data
The combined work of Guaraco, Hutchinson, Tonegawa and Wickramasekera has recently produced a new proof of the classical theorem that any closed Riemannian manifold of dimension n+1≥3 contains a minimal hypersurface with a singular set of Hausdorff dimension at most n−7. This proof avoids the Almgren--Pitts …
Sample-Rank simplifies MO recommendations by sampling and ranking, improving revenue with stable conversion rates.
problem Multi-objective recommendations in online food ordering systems.
method Multi-goal sampling followed by ranking, reducing MO problem to LTR model.
result Significant lift in revenue (2.64%) with stable conversion rates, no drop in last-mile traversal.
Proposes a dynamic matching algorithm for two-sided online markets.
problem Dynamic preferences in two-sided online matching platforms.
method Dynamic Matching Bandit Algorithm with statistical preference ranking estimation.
result Agent-optimal stable matching result with logarithmic regret bound.
New bounds for knot complexity based on Jones polynomial coefficients.
problem Finding bounds for the crosscap number of knots and links.
method Using coefficients from the Jones polynomial, we derive two-sided bounds for Conway sums of strongly alternating tangles.
result Neither linear bound generalizes for all knots and links.
Characterizes closures of mapping class group orbits on non-orientable surfaces.
problem Understanding closures of orbits in Teichmüller spaces for non-orientable surfaces.
method Analyzes closures in ML and PML for measured laminations, projective measured laminations, and points. result Characterizes closures of weighted two-sided curves in ML. Alternative app data improves credit scoring for underserved borrowers.
problem Improving credit scoring for low-wealth and young individuals.
method Use of alternative data from app-based marketplaces, validated with TreeSHAP method.
result Alternative data sources predict financial behavior better than traditional bureau data.