paper-with-me

홈 › Papers

Online Prompt Pricing based on Combinatorial Multi-Armed Bandit and Hierarchical Stackelberg Game

2024-05-24 · Meiling Li, Hongrun Ren, Haixu Xiong, Zhenxing Qian, Xinpeng Zhang

Generation models have shown promising performance in various tasks, making trading around machine learning models possible. In this paper, we aim at a novel prompt trading scenario, prompt bundle trading (PBT) system, and propose an online pricing mechanism. Based on the combinatorial multi-armed bandit (CMAB) and three-stage hierarchical Stackelburg (HS) game, our pricing mechanism considers the profits of the consumer, platform, and seller, simultaneously achieving the profit satisfaction of these three participants. We break down the pricing issue into two steps, namely unknown category selection and incentive strategy optimization. The former step is to select a set of categories with the highest qualities, and the latter is to derive the optimal strategy for each participant based on the chosen categories. Unlike the existing fixed pricing mode, the PBT pricing mechanism we propose is more flexible and diverse, which is more in accord with the transaction needs of real-world scenarios. We test our method on a simulated text-to-image dataset. The experimental results demonstrate the effectiveness of our algorithm, which provides a feasible price-setting standard for the prompt marketplaces.

📄 PDF Abstract BibTeX arXiv:2405.15154

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Combinatorial Semi-Bandits with Knapsacks

2017-05-23 · Karthik Abinav Sankararaman, Aleksandrs Slivkins

We unify two prominent lines of work on multi-armed bandits: bandits with knapsacks (BwK) and combinatorial semi-bandits. The former concerns limited "resources" consumed by the algorithm, e.g., limited supply in dynamic…

Multi-Armed Bandits

Multi-armed Bandit Requiring Monotone Arm Sequences

2021-06-07 · NeurIPS 2021 12 · Ningyuan Chen

In many online learning or multi-armed bandit problems, the taken actions or pulled arms are ordinal and required to be monotone over time. Examples include dynamic pricing, in which the firms use markup pricing policies…

Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach

2023-08-21 · Arman Rahbar, Niklas Åkerblom, Morteza Haghir Chehreghani

Online decision making plays a crucial role in numerous real-world applications. In many scenarios, the decision is made based on performing a sequence of tests on the incoming data points. However, performing all tests …

Decision MakingMulti-Armed BanditsThompson Sampling

Adaptive Model Selection Framework: An Application to Airline Pricing

2019-05-21 · Naman Shukla, Arinbjörn Kolbeinsson, Lavanya Marla, Kartik Yellepeddi

Multiple machine learning and prediction models are often used for the same prediction or recommendation task. In our recent work, where we develop and deploy airline ancillary pricing models in an online setting, we fou…

Model SelectionThompson Sampling

Adversarial Attacks on Combinatorial Multi-Armed Bandits

2023-10-08 · Rishab Balasubramanian, Jiawei Li, Prasad Tadepalli, Huazheng Wang 외

We study reward poisoning attacks on Combinatorial Multi-armed Bandits (CMAB). We first provide a sufficient and necessary condition for the attackability of CMAB, a notion to capture the vulnerability and robustness of …

Multi-Armed Bandits