No article text was recorded for this version.
preference uncertainty
Version 2 of 279 papers109 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Decentralized Two-Sided Bandit Learning in Matching Market
- Blog: Probably Correct Optimal Stable Matching for Two-Sided Markets Under Uncertainty
- Blog: Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility
- Blog: Improved Analysis for Bandit Learning in Matching Markets
- Blog: Centralized Borrower and Lender Matching under Uncertainty for P2P Lending
- Blog: Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets
- Blog: Optimal Algorithms for Bandit Learning in Matching Markets
- Blog: Two-Sided Bandits and the Dating Market
- Blog: Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets
- Blog: Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints
- Blog: A Survey on Bandit Learning in Matching Markets
- Blog: Bandits in Matching Markets: Ideas and Proposals for Peer Lending
- Blog: Regret, stability, and fairness in matching markets with bandit learners
- Blog: Competing Bandits in Matching Markets
- Blog: Bandit based centralized matching in two-sided markets for peer to peer lending
- Blog: Thompson Sampling for Bandit Learning in Matching Markets
- Blog: Learning Strategies in Decentralized Matching Markets under Uncertain Preferences
- Blog: Stable Matching with Ties: Approximation Ratios and Learning
- Blog: Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning
- Blog: Regret, stability & fairness in matching markets with bandit learners
- Blog: Double Matching Under Complementary Preferences
- Blog: Decentralized Matching in a Probabilistic Environment
- Blog: Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints
- Blog: Learning for Matching Game in Cooperative D2D Communication with Incomplete Information
- Blog: Honor Among Bandits: No-Regret Learning for Online Fair Division
- Blog: FraPPE: Fast and Efficient Preference-Based Pure Exploration
- Blog: Mitigating Externalities while Learning: an Online Version of the Coase Theorem
- Blog: Principal-Agent Bandit Games with Self-Interested and Exploratory Learning Agents
- Blog: Rate-Optimal Contextual Online Matching Bandit
- Blog: Thompson Sampling for Bandit Learning in Matching Markets
- Blog: Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit
- Blog: Popular and Dominant Matchings with Uncertain and Multimodal Preferences
- Blog: Competing Bandits in Matching Markets
- Blog: On Nash Equilibria in Normal-Form Games With Vectorial Payoffs
- Blog: Sequential Blocked Matching
- Blog: Online Learning of Coalition Structures by Selfish Agents
- Blog: Multi-agent Reinforcement Learning for Decentralized Coalition Formation Games
- Blog: $\varepsilon$-fractional core stability in Hedonic Games.
- Blog: Online Learning and Matching for Resource Allocation Problems
- Blog: Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach
- Blog: Competing Bandits in Matching Markets
- Blog: Competing Bandits in Decentralized Large Contextual Matching Markets
- Blog: Robust Market Equilibria with Uncertain Preferences
- Blog: Bandit Learning in Housing Markets
- Blog: A Contextual Combinatorial Bandit Approach to Negotiation
- Blog: Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning
- Blog: Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
- Blog: Player-optimal Stable Regret for Bandit Learning in Matching Markets
- Blog: Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets
- Blog: Competing Bandits in Time Varying Matching Markets
- Blog: Interactive Learning with Pricing for Optimal and Stable Allocations in Markets
- Blog: Learning Fair Division from Bandit Feedback
- Blog: Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
- Blog: Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
- Blog: Incentivizing Exploration by Heterogeneous Users
- Blog: Heterogeneous Multi-Agent Bandits with Parsimonious Hints
- Blog: Dynamic Matching Bandit For Two-Sided Online Markets
- Blog: Wisdom and Foolishness of Noisy Matching Markets
- Blog: Bayesian Persuasion in Sequential Decision-Making
- Blog: Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent
Showing 60 of 79 papers.
History & citation
Current · Permanent link
- Bandit Learning with Collisions in Matching Markets merged into this direction (79% overlap)
- Learning Stable Matchings in Decentralized Markets merged into this direction (57% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_preference_uncertainty_9ff26f2c,
title = {preference uncertainty},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/preference-uncertainty/rdr_9ff26f2cc1394de2ac0e602ed7fe93d6},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_preference_uncertainty_9ff26f2c_v2,
title = {preference uncertainty},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/preference-uncertainty/rdr_9ff26f2cc1394de2ac0e602ed7fe93d6/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}