Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

199399598797 · Jun 202019922001200920172026
48 results for marketplace optimization

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.

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…

2018-09-06abs ↗pdf ↗

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.

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.

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…

2018-09-06abs ↗pdf ↗

Correctly pricing products or services in an online marketplace presents a challenging problem and one of the critical factors for the success of the business. When users are looking to buy an item they typically search for it. Query relevance models are used at this stage to retrieve and rank the items on the search p…

2019-11-14abs ↗pdf ↗

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.

Efficiently projects points onto polytopes, especially useful in web-scale applications.

problem Efficiently projecting points onto polytopes in large-scale applications.
method Developed a vertex-oriented incremental algorithm for polytope projection, tailored for simplex and unit-box cut polytopes.
result Majority of projections lie on vertices of polytopes, leading to significant performance improvements.

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.

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…

2015-09-22abs ↗pdf ↗

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.

The theory of rational choice assumes that when people make decisions they do so in order to maximize their utility. In order to achieve this goal they ought to use all the information available and consider all the choices available to choose an optimal choice. This paper investigates what happens when decisions are m…

2017-03-29abs ↗pdf ↗

Method prevents model divergence in rapidly changing ad markets.

problem Model divergence due to rapid ad turnover and discontinuity.
method Dual ascent optimization with latent vector constraints.
result Significant reduction in diverging instances and improved user experience/revenue.

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.

Improved model accuracy can reduce overall user accuracy in competitive markets.

problem The impact of model competition on overall user accuracy.
method Defined a model of competition for classification tasks and used data representations to study the effect of scale.
result Improving data representation quality can decrease overall predictive accuracy across users (social welfare) in a competitive market.

The paper optimizes A/B tests by balancing lift and cost in large-scale settings.

problem Balancing lift and cost in A/B tests for large-scale experimentation.
method Empirical Bayes approach using a greedy knapsack algorithm to rank experiments based on lift-to-cost ratio, incorporating local false discovery rate (lfdr).
result The proposed method maximizes expected profit while controlling false discovery rate, demonstrating superior performance in large-scale settings.

Conventional Learning-to-Rank (LTR) methods optimize the utility of the rankings to the users, but they are oblivious to their impact on the ranked items. However, there has been a growing understanding that the latter is important to consider for a wide range of ranking applications (e.g. online marketplaces, job plac…

2019-02-11abs ↗pdf ↗

The paper addresses Qini curve estimation under clustered network interference.

problem Qini curves can be biased when interference is ignored in clustered network settings.
method Proposes three estimation strategies for clustered network interference.
result Identifies the most appropriate approach based on bias-variance trade-offs.

We discuss several uses of blockchain (and, more generally, distributed ledger) technologies outside of cryptocurrencies with a pragmatic view. We mostly focus on three areas: the role of coin economies for what we refer to as data malls (specialized data marketplaces); data provenance (a historical record of data and …

2018-02-21abs ↗pdf ↗

Study optimizes crowdfunding platform offerings based on customer behavior.

problem Maximizing crowdfunding platform revenue through optimal product assortment.
method Multinomial logit model and machine learning methods (multivariate regression, classification) for revenue prediction.
result Optimal assortments can significantly increase platform revenue.

New algorithm optimizes interventions under network interference, scaling to large networks.

problem Optimal policy learning under network interference where one individual's treatment affects others.
method Developed a scalable Thompson sampling algorithm for dynamic networks.
result Proved a Bayesian regret bound that is sublinear in network size and rounds.

Study breaks down graphs into structural and featural components for task-agnostic data valuation.

problem Lack of methods to assess the value of graphs in data marketplaces.
method Introduces blind message passing framework to evaluate graphs without specific task metrics.
result Demonstrates effectiveness in capturing structural disparities, relevance, and diversity of seller data for buyers.

Contextual bandit framework improves revenue optimization in securities lending market.

problem Optimizing revenue for agent lenders in a dynamic securities lending market.
method Utilized contextual bandit frameworks to address dynamic pricing problems in an e-commerce-like securities lending market.
result Contextual bandit approach consistently outperforms traditional methods by at least 15% in total revenue generated.

The paper introduces Absolute Shapley Value to handle negative contributions in machine learning model training.

problem Negative marginal contributions in machine learning model training.
method Investigates three philosophies: Original Shapley Value, Zero Shapley Value, and Absolute Shapley Value.
result Absolute Shapley Value significantly outperforms other definitions in evaluating data importance.

Financial asset markets are sociotechnical systems whose constituent agents are subject to evolutionary pressure as unprofitable agents exit the marketplace and more profitable agents continue to trade assets. Using a population of evolving zero-intelligence agents and a frequent batch auction price-discovery mechanism…

2018-12-13abs ↗pdf ↗

The paper offers algorithms for managing freelancers and in-house workers in online labor markets.

problem Managing freelancers and in-house workers in online labor markets efficiently.
method Developed algorithms for team formation with outsourcing in an online setting.
result Efficient online algorithms for minimizing costs in hiring and outsourcing.

Study of repeated principal-agent bandit game with self-interested and exploratory learning agents.

problem Interaction between principal and agent in unknown environments with learning and exploration behaviors.
method Developed algorithms for self-interested and exploratory learning agents with bandit feedback, achieving regret bounds.
result Achieved O~(T2/3)\widetilde{O}(T^{2/3}) regret bound for exploratory learning agent in i.i.d. reward setup.

Study copyright's impact on creative industries using AI-generated fonts.

problem Estimating supply and demand in creative industries with AI-generated content.
method Neural network embeddings, spatial regression, event-study analyses, structural model of supply and demand.
result Copyright can raise consumer welfare by encouraging product relocation.

In today's day and age when almost every industry has an online presence with users interacting in online marketplaces, personalized recommendations have become quite important. Traditionally, the problem of collaborative filtering has been tackled using Matrix Factorization which is linear in nature. We extend the wor…

2018-07-14abs ↗pdf ↗