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

68136203271 · Jun 202019922001200920172026
48 results for customer choice behavior

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.

Proposes robust assortment optimization from observational data.

problem Real-world scenarios often violate assumptions of stable customer preferences and correct choice models.
method Develops a robust framework that accounts for potential distributional shifts in customer choice behavior.
result Uncovered the notion of ``robust item-wise coverage'' as the minimal data requirement for sample-efficient robust assortment learning.

The purpose of this paper is to identify the immediate and future retailer response to wholesale stockouts. We perform a statistical analysis of historical customer order and delivery data of a local tool wholesaler and distributor, whose customers are retailers, over a period of four years. We investigate the effect o…

2019-03-10abs ↗pdf ↗

We study a stylized dynamic assortment planning problem during a selling season of finite length TT. At each time period, the seller offers an arriving customer an assortment of substitutable products and the customer makes the purchase among offered products according to a discrete choice model. The goal of the selle…

2018-06-27abs ↗pdf ↗

Dynamic assortment problem on two-sided platform with unknown parameters

problem Optimizing assortment display in an online platform with incomplete information and heterogeneous customers
method Data-driven algorithm that learns choice parameters while optimizing revenue
result Worst-case regret grows polylogarithmically over time

Ebay uses forecasting and simulation to decide when to disable a vendor.

problem Determining the optimal time to disable a vendor to avoid customer loss.
method Data-driven approach involving multiplicative seasonality model, Monte Carlo simulation, and linear model.
result Identifies the best time to disable a vendor to minimize customer loss.

Proposes new methods for Markov chain choice models with panel data.

problem Dependence among transactions for the same customer in historical data.
method Expectation-maximization (EM) algorithms incorporating partial-ordering preference information.
result EM algorithms outperform traditional methods on synthetic and real datasets.

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

This study benchmarks AI agents for personalized retail promotions using simulations.

problem Optimizing coupon targeting for sparse customer purchase events.
method Comprehensive simulations of customer shopping behaviors; training RL agents on batch data.
result Contextual bandit and deep RL methods outperform static policies in sparse reward environments.

We study the pricing problem faced by a firm that sells a large number of products, described via a wide range of features, to customers that arrive over time. Customers independently make purchasing decisions according to a general choice model that includes products features and customers' characteristics, encoded as…

2016-09-24abs ↗pdf ↗

We consider a planning problem where the dynamics and rewards of the environment depend on a hidden static parameter referred to as the context. The objective is to learn a strategy that maximizes the accumulated reward across all contexts. The new model, called Contextual Markov Decision Process (CMDP), can model a cu…

2015-02-08abs ↗pdf ↗

Study predicts customer data sharing in Open Banking and explains key factors.

problem Predicting and explaining customer data sharing in Open Banking environments.
method Hybrid data balancing strategy with ADASYN and NEARMISS, XGBoost models, SHAP, CART.
result 91.39% accuracy for inflow and 91.53% for outflow predictions, revealing influential features.

Study models growth of unorganized retail in Indian pharma sector amid organized and e-retail competition.

problem Survival strategies of unorganized retailers challenged by organized and e-retailers.
method Field investigation, conjoint analysis, design of experiments, agent-based simulation.
result Unorganized retailers' performance influenced by their own attribute levels and price discounts.

In the age of data driven solution, the customer demographic attributes, such as gender and age, play a core role that may enable companies to enhance the offers of their services and target the right customer in the right time and place. In the marketing campaign, the companies want to target the real user of the GSM …

2019-02-20abs ↗pdf ↗

Novel method CHPCA simplifies complex market dynamics.

problem Quantifying interactions in rapidly evolving consumer goods markets.
method Complex Hilbert Principal Component Analysis (CHPCA) and Hodge decomposition.
result Revealed comovements and customer heterogeneity in consumer choice process.

The DeepSurv model predicts purchase timing better than other survival models.

problem Predicting the exact purchase timing of consumers.
method Survival models (Kernel SVM, DeepSurv, Survival Random Forest, MTLR) were compared using various consumer attributes.
result DeepSurv model outperformed other models in predicting purchase completion.

Paper proposes a method to aggregate customer engagement data for better ranking of e-commerce results.

problem Cold start problem and under-representation of new or under-impressed products in e-commerce search results.
method Aggregates customer engagements within a day for the same query as input training data for machine learning models.
result Training models on aggregated data leads to better ranking of new and under-impressed products.

It is of high interest for a company to identify customers expected to bring the largest profit in the upcoming period. Knowing as much as possible about each customer is crucial for such predictions. However, their demographic data, preferences, and other information that might be useful for building loyalty programs …

2018-03-28abs ↗pdf ↗

We study a general problem of allocating limited resources to heterogeneous customers over time under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically consumes some combination of resources, and returns different rewards for the resources consumed. We consid…

2018-10-11abs ↗pdf ↗

Customer Satisfaction is the most important factors in the industry irrespective of domain. Key Driver Analysis is a common practice in data science to help the business to evaluate the same. Understanding key features, which influence the outcome or dependent feature, is highly important in statistical model building.…

2018-05-25abs ↗pdf ↗

Whenever customers' choices (e.g. to buy or not a given good) depend on others choices (cases coined 'positive externalities' or 'bandwagon effect' in the economic literature), the demand may be multiply valued: for a same posted price, there is either a small number of buyers, or a large one -- in which case one says …

2012-09-06abs ↗pdf ↗

We study a resource utilization scenario characterized by intrinsic fitness. To describe the growth and organization of different cities, we consider a model for resource utilization where many restaurants compete, as in a game, to attract customers using an iterative learning process. Results for the case of restauran…

2014-03-07abs ↗pdf ↗

Study examines pricing strategies in competitive supply chains with discrete prices.

problem Inaccurate assumptions in traditional SC models for pricing decisions.
method Examines a SC model with one supplier and two manufacturers, considering customer demand segmentation and discrete price setting.
result Nash equilibria among manufacturers are not unique, and low denomination factors can lead to instability.

This work studies the parameter identification problem for the Markov chain choice model of Blanchet, Gallego, and Goyal used in assortment planning. In this model, the product selected by a customer is determined by a Markov chain over the products, where the products in the offered assortment are absorbing states. Th…

2017-06-02abs ↗pdf ↗

Silent abandonment reduces contact center efficiency by 5%-15%.

problem Measuring customer abandonment and patience in text-based contact centers is challenging due to uncertainty.
method Developed methodologies to identify silent-abandonment customers and estimate customer patience using text analysis and queueing models.
result Silent abandonment accounts for 30%-67% of customer abandonments and reduces system efficiency by 5%-15%.