JPJennifer Ann Pazour

Jennifer Ann Pazour

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jennifer Ann Pazour has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Community-Oriented Market Design for Nonprofit Resource Exchange

    by Weixiao Huang, Carlos Morel Figueroa, Arjun Venat, Sarah E. Stanlick, Yunus D. Telliel, Alexander Teytelboym, Jennifer A. Pazour, Andrew C. Trapp

    Unlocking Value Through Nonprofit Resource Sharing Nonprofit organizations often operate under tight budgets while idle equipment, unused space, and shareable skills and expertise are frequently underutilized, with existing resource exchanges in the nonprofit sector limited to bilateral barter or relatively homogeneous resources. In “Community-Oriented Market Design for Nonprofit Resource Exchange,” Huang et al. propose Sharing With a Purpose (SWAP), a resource-sharing system that enables nonprofits to exchange heterogeneous resources without monetary payments. SWAP combines an auction-based process, SWAPcredit valuation, and integer optimization to facilitate multilateral exchanges, allowing nonprofits to obtain needed resources by contributing resources of their own. The authors implement this market design through the SWAP Hub, a digital platform deployed with nonprofit communities in multiple regions. Through repeated exchange episodes, participating organizations have shared not only physical assets but also a wide range of skills, services, and expertise, including marketing, management, event planning, and organizational development. The study demonstrates how innovative market design can unlock latent value in community resources, alleviate resource constraints, and encourage new connections and collaboration among nonprofit organizations.

  • Assessing economic and operational feasibility of a designed and lab demonstrated robotic platform for omnichannel logistics

    by Joyjit Bhowmick, Sebastian Köhler, Gideon Arndt, Georg Fischer, Manmit Padhy, Kai Furmans, Jennifer Pazour

  • Increasing driver flexibility through personalized menus and incentives in ridesharing and crowdsourced delivery platforms

    by Hannah Horner, Jennifer Pazour, John E. Mitchell

    This article formulates and solves a stochastic optimization model to investigate the impact of crowdsourced platforms (e.g., ridesharing, on‐demand delivery, volunteer food rescue, and carpooling) offering small, personalized menus of requests and incentive offers for drivers to choose from. To circumvent nonlinear variable relationships, we exploit model structure to formulate the program as a stochastic linear integer program. The proposed solution approach models stochastic responses as a sample of variable and fixed scenarios, and to counterbalance solution overfitting, uses a participation ratio parameter. The problem is also decomposed and iterated among two separate subproblems, one which optimizes menus, and another, which optimizes incentives. Computational experiments, based on a ride sharing application using occasional drivers demonstrate the importance of using multiple scenarios to capture stochastic driver behavior. Our method provides robust performance even when discrepancies between predicted and observed driver behaviors exist. Computational results show that offering menus and personalized incentives can significantly increase match rates and platform profit compared to recommending a single request to each driver. Further, compared to the menu‐only model, the average driver income is increased, and more customer requests are matched. By strategically using personalized incentives to prioritize promising matches and to increase drivers' willingness to accept requests, our approach benefits both drivers and customers. Higher incentives are offered when drivers are more likely to accept, while fewer incentives and menu slots are reserved for driver‐request pairs less likely to be accepted.


  • Open Access

    Empowering Collective Impact: Introducing SWAP for Resource Sharing

    by Weixiao Huang, Elise Jade Deshusses, Jennifer Ann Pazour, Yunus Doğan Telliel, Sarah Eliza Stanlick, Andrew Christopher Trapp


  • Online acceptance probability approximation in peer-to-peer transportation

    by Rosemonde Ausseil, Marlin W. Ulmer, Jennifer A. Pazour


  • Crowdsourced order‐fulfillment policies using in‐store customers

    by Iman Dayarian, Jennifer Pazour

    Omni‐channel services, such as buy‐online‐pick‐up‐from‐store, transfer the in‐store logistics once completed by shoppers to retailers. To cost‐effectively meet the high demands for such pickup services, we introduce a crowdsourced order‐fulfillment policy that deploys in‐store customers to pick items for online orders while completing their own personal shopping. As opposed to existing store fulfillment policies, this new concept utilizes in‐store customers to help, not constrain, dedicated pickers. Empirical data indicate that a high percentage of surveyed in‐store shoppers would be willing to occasionally participate in such a program. In‐store customers willing to participate were observed to be heterogeneous in their efforts, with variability in how much extra time they would be willing to provide and would prefer picking tasks that had only a small deviation from their personal shopping. Motivated by these empirical results, the decision problem of how to assign picking tasks for arriving online orders with a given service commitment, to a set of arriving in‐store customers or an abundant set of dedicated pickers, was formalized to capture the uncertainty and heterogeneity of using in‐store customers for in‐store picking tasks. We propose a tractable decision‐making methodology to determine whether an order will meet both service commitment feasibility and in‐store customer availability with a probability at least equal to a target threshold. This method captures dynamic order placements and in‐store customer arrivals and stochasticity in in‐store customers' shopping baskets. Extensive computational experiments for varying operational conditions of a grocery store dynamically matching actual online orders to arriving in‐store customers helps answer open questions from practitioners. Compensating in‐store customers based on their additional efforts reduced costs of fulfillment by greater than 30%, on average, compared to a baseline that uses only dedicated pickers for store fulfillment. Using the past five shopping baskets of participating in‐store customers to estimate assignment decisions can achieve both high online order service commitments and in‐store customer availability requirements. Our results suggest that in‐store customers should be assigned smaller orders than dedicated pickers.


  • Supplier Menus for Dynamic Matching in Peer-to-Peer Transportation Platforms

    by Rosemonde Ausseil, Jennifer A. Pazour, Marlin W. Ulmer

    Peer-to-peer transportation platforms dynamically match requests (e.g., a ride, a delivery) to independent suppliers who are not employed nor controlled by the platform. Thus, the platform cannot be certain that a supplier will accept an offered request. To mitigate this selection uncertainty, a platform can offer each supplier a menu of requests to choose from. Such menus need to be created carefully because there is a trade-off between selection probability and duplicate selections. In addition to a complex decision space, supplier selection decisions are vast and have systematic implications, impacting the platform’s revenue, other suppliers’ experiences (in the form of duplicate selections), and the request waiting times. Thus, we present a multiple scenario approach, repeatedly sampling potential supplier selections, solving the corresponding two-stage decision problems, and combining the multiple different solutions through a consensus algorithm. Extensive computational results using the Chicago Region as a case study illustrate that our method outperforms a set of benchmark policies. We quantify the value of anticipating supplier selection, offering menus to suppliers, offering requests to multiple suppliers at once, and holistically generating menus with the entire system in mind. Our method leads to more balanced assignments by sacrificing some “easy wins” toward better system performance over time and for all stakeholders involved, including increased revenue for the platform, and decreased match waiting times for suppliers and requests.