Bandit based centralized matching in two-sided markets for peer to peer lending
Soumajyoti Sarkar

TL;DR
This paper introduces a bandit-based sequential decision framework for centralized matching in two-sided peer-to-peer lending markets, addressing implicit competition and uncertainty faced by lenders.
Contribution
It proposes a novel bandit algorithm for dynamic matching in two-sided markets considering lender restrictions and market uncertainty.
Findings
Lender regret depends on initial preferences and affects learning.
Simulation shows the proposed method adapts to market dynamics.
The approach improves understanding of lender decision-making under competition.
Abstract
Sequential fundraising in two sided online platforms enable peer to peer lending by sequentially bringing potential contributors, each of whose decisions impact other contributors in the market. However, understanding the dynamics of sequential contributions in online platforms for peer lending has been an open ended research question. The centralized investment mechanism in these platforms makes it difficult to understand the implicit competition that borrowers face from a single lender at any point in time. Matching markets are a model of pairing agents where the preferences of agents from both sides in terms of their preferred pairing for transactions can allow to decentralize the market. We study investment designs in two sided platforms using matching markets when the investors or lenders also face restrictions on the investments based on borrower preferences. This situation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Auction Theory and Applications · FinTech, Crowdfunding, Digital Finance
