Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Filters








3,620 Hits in 2.8 sec

Competing Bandits in Matching Markets [article]

Lydia T. Liu, Horia Mania, Michael I. Jordan
2020 arXiv   pre-print
With the advent of massive online markets powered by data-driven matching platforms, it has become necessary to better understand the interplay between learning and market objectives.  ...  Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned.  ...  bandits" for a different problem formulation where a user can choose between two different bandit algorithms; this differs from our setting where multiple learners compete over scarce resources.  ... 
arXiv:1906.05363v2 fatcat:3l7lzpaoszdjhjz6o5sd4kz4wy

Competing Bandits in Time Varying Matching Markets [article]

Deepan Muthirayan, Chinmay Maheshwari, Pramod P. Khargonekar, Shankar Sastry
2023 arXiv   pre-print
We study the problem of online learning in two-sided non-stationary matching markets, where the objective is to converge to a stable match.  ...  In particular, we consider the setting where one side of the market, the arms, has fixed known set of preferences over the other side, the players.  ...  CONCLUSIONS AND FUTURE WORK In this work, we study the framework of competing bandits in time varying matching markets.  ... 
arXiv:2210.11692v2 fatcat:lhid24ei4fborf7x3wnoxtppwe

Decentralized Competing Bandits in Non-Stationary Matching Markets [article]

Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi, Arya Mazumdar
2022 arXiv   pre-print
Understanding complex dynamics of two-sided online matching markets, where the demand-side agents compete to match with the supply-side (arms), has recently received substantial interest.  ...  To that end, in this paper, we introduce the framework of decentralized two-sided matching market under non stationary (dynamic) environments.  ...  Supplementary Material for "Competing Bandits in Non-Stationary Matching Markets" A Related Works on Non-Stationary Bandits The framework on non stationary bandits were introduced in Whittle (1988) in  ... 
arXiv:2206.00120v1 fatcat:6v6hla76wjeproqye3dluzfofe

Beyond the brotherhood: Skoal Bandits' role in the evolution of marketing moist smokeless tobacco pouches

Yogi H. Hendlin, Jessica R. Veffer, M. Jane Lewis, Pamela M. Ling
2017 Tobacco Induced Diseases  
Acknowledgements AC Nielsen Scantrack data analysis on 2014 market share of pouch products courtesy of Dr. Christine D Delnevo.  ...  To compete, Bandits' 1983 public launch became USST's biggest advertising campaign expenditure to date [45, 46] .  ...  Frost, Spice, Original, Robust, Winterchill 2006- General Swedish Match Dry Original, White More heavily in the US after 2006 Catch Dry Swedish Match Dry Eucalyptus, Licorice, Vanilla, Coffee  ... 
doi:10.1186/s12971-017-0150-y pmid:29270101 pmcid:PMC5735793 fatcat:aobrkvblbrfybhnwf6loyj6kyq

Multi-Agent Dynamic Pricing in a Blockchain Protocol Using Gaussian Bandits [article]

Alexis Asseman, Tomasz Kornuta, Anirudh Patel, Matt Deible, Sam Green
2023 arXiv   pre-print
One dimension along which Indexers compete is pricing. In this paper, we propose a bandit-based algorithm for maximization of Indexers' revenue via Consumer budget discovery.  ...  We discuss the results achieved by our dynamic pricing bandits both in simulation and deployed into production on one of the Indexers operating on Ethereum.  ...  in this paper.  ... 
arXiv:2212.07942v2 fatcat:kwtemoaicff7rmcvehbtg24u24

Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets [article]

Chinmay Maheshwari and Eric Mazumdar and Shankar Sastry
2022 arXiv   pre-print
We study the problem of online learning in competitive settings in the context of two-sided matching markets.  ...  In particular, one side of the market, the agents, must learn about their preferences over the other side, the firms, through repeated interaction while competing with other agents for successful matches  ...  In this work we design algorithms for learning while matching in a class of structured matching markets known as α−reducible matching markets.  ... 
arXiv:2206.02344v1 fatcat:ohfyealuo5hizmsl4pbpvldg6i

ECOLOGY: Globalization, Roving Bandits, and Marine Resources

F. Berkes
2006 Science  
Addressing the ecological impacts of globalization means finding ways to match the growth in demand for local marine products, with the development of institutions to regulate harvesting (15) .  ...  Distant water fleets and mobile traders can operate like roving bandits (7) , because global markets often fail to generate the self-interest that arises from attachment to place.  ... 
doi:10.1126/science.1122804 pmid:16543444 fatcat:kadauffinjdubdt7fpis4eyhqi

Learning Equilibria in Matching Markets from Bandit Feedback [article]

Meena Jagadeesan, Alexander Wei, Yixin Wang, Michael I. Jordan, Jacob Steinhardt
2023 arXiv   pre-print
Algorithmically, we show that "optimism in the face of uncertainty," the principle underlying many bandit algorithms, applies to a primal-dual formulation of matching with transfers and leads to near-optimal  ...  Our work takes a first step toward elucidating when and how stable matchings arise in large, data-driven marketplaces.  ...  matchings from bandit feedback in the Gale-Shapley stable marriage model [GS62] .  ... 
arXiv:2108.08843v2 fatcat:k4rzzzowuzfgno5uq2q73cw5ja

An assessment of strategies for choosing between competitive marketplaces

T. Miller, J. Niu
2012 Electronic Commerce Research and Applications  
Traders that operate in markets with multiple competing marketplaces must often choose with which marketplace they will trade.  ...  The -decreasing strategy performs well in adaptive markets, while also showing greater stability in its parameter space than softmax.  ...  Conclusion In this paper, we assess several N-armed bandit algorithms for solving the problem of marketplace selection in double-auction markets with competing marketplaces.  ... 
doi:10.1016/j.elerap.2011.07.009 fatcat:cch6m3ly25ctvm7gprjtnkkzoe

Bandit based centralized matching in two-sided markets for peer to peer lending [article]

Soumajyoti Sarkar
2023 arXiv   pre-print
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 simulate two sided market matchings in a sequential decision framework and show the dynamics of the lender regret amassed compared to the optimal borrower-lender matching and find that the lender regret  ...  The goal of this paper has been to lay out some ideas in which centralized peer lending platforms can be abstracted from a matching market perspective and how bandits could play a role in such mechanism  ... 
arXiv:2105.02589v2 fatcat:4wufwxb6l5f3jf7jbfysaz6fci

Regret, stability fairness in matching markets with bandit learners [article]

Sarah H. Cen, Devavrat Shah
2022 arXiv   pre-print
We build on a line of work that models this setting as a two-sided matching market with bandit learners.  ...  , fairness in the distribution of regret, and high social welfare.  ...  This work was supported in parts by the MIT-IBM project on "Representation Learning as a Tool for Causal Discovery", the NSF TRIPODS Phase II grant towards Foundations of Data Science Institute, the Chyn  ... 
arXiv:2102.06246v2 fatcat:hqzalusd5bd4lm3azwjepfwq5y

A Multi-Armed Bandit-based Approach to Mobile Network Provider Selection [article]

Thomas Sandholm, Sayandev Mukherjee
2021 arXiv   pre-print
Experiments showed that we can learn both user behavior and network performance efficiently, and recorded 25-74% improvements in QoE under various competing agent scenarios.  ...  We show that the problem of provider selection can be formulated as a so-called Bandit problem.  ...  about competing users that can be used in centralized decisions.  ... 
arXiv:2012.04755v2 fatcat:pmoz6lrp3naabnkc5k73j52vx4

Player-optimal Stable Regret for Bandit Learning in Matching Markets [article]

Fang Kong, Shuai Li
2023 arXiv   pre-print
The problem of matching markets has been studied for a long time in the literature due to its wide range of applications. Finding a stable matching is a common equilibrium objective in this problem.  ...  This result significantly improves previous works which either have a weaker player-pessimal stable matching objective or apply only to markets with special assumptions.  ...  Das and Kamenica [2005] first introduce the bandit problem in matching markets.  ... 
arXiv:2307.10890v1 fatcat:eyiavjpjqbe3hikblj4j77fla4

A survey on multi-player bandits [article]

Etienne Boursier, Vianney Perchet
2024 arXiv   pre-print
This survey contextualizes and organizes the rich multiplayer bandits literature. In light of the existing works, some clear directions for future research appear.  ...  Due mostly to its application to cognitive radio networks, multiplayer bandits gained a lot of interest in the last decade. A considerable progress has been made on its theoretical aspect.  ...  Competing bandits The problem of competing bandits was first introduced by Liu et al. (2020), motivated by decentralized learning processes in matching markets.  ... 
arXiv:2211.16275v2 fatcat:ljl36xoqoregbmwettxaaf6u3a

Market Making with Costly Monitoring: An Analysis of the SOES Controversy

Thierry Foucault, Ailsa Röell, Patrik Sandås
2003 The Review of financial studies  
This effect strengthens the dealers' incentives to price compete. Nevertheless, the cost sharing effect that we identified in the previous section still holds.  ...  In response, Nasdaq market makers have expended considerable effort to eliminate SOES bandits through regulation.  ... 
doi:10.1093/rfs/hhg005 fatcat:uezj5b7dmnh4bkb45trqyqfo5u
« Previous Showing results 1 — 15 out of 3,620 results