On the public citation graph

Dynamic Pricing with Limited Supply

0 signed · 96 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-17572-5_13openalex-snapshot
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-snapshot
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.059openalex-snapshot
Pure exploration in finitely-armed and continuous-armed bandits
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1109/focs.2013.30openalex-snapshot
Bandits with Knapsacks
inferredcites →https://doi.org/10.1109/sfcs.2003.1238232openalex-snapshot
The value of knowing a demand curve: bounds on regret for online posted-price auctions
inferredcites →https://doi.org/10.1111/j.2517-6161.1979.tb01068.xopenalex-snapshot
Bandit Processes and Dynamic Allocation Indices
inferredcites →https://doi.org/10.1137/1.9781611973082.56openalex-snapshot
Mechanism Design via Correlation Gap
inferredcites →https://doi.org/10.1137/s0097539701398375openalex-snapshot
The Nonstochastic Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1137/s0363012992237273openalex-snapshot
The Continuum-Armed Bandit Problem
inferredcites →https://doi.org/10.1145/1367497.1367522openalex-snapshot
Dynamic cost-per-action mechanisms and applications to online advertising
inferredcites →https://doi.org/10.1145/1374376.1374390openalex-snapshot
Optimal mechanism design and money burning
inferredcites →https://doi.org/10.1145/1374376.1374475openalex-snapshot
Multi-armed bandits in metric spaces
inferredcites →https://doi.org/10.1145/1566374.1566381openalex-snapshot
Limited and online supply and the bayesian foundations of prior-free mechanism design
inferredcites →https://doi.org/10.1145/1566374.1566386openalex-snapshot
Characterizing truthful multi-armed bandit mechanisms
inferredcites →https://doi.org/10.1145/1566374.1566388openalex-snapshot
The price of truthfulness for pay-per-click auctions
inferredcites →https://doi.org/10.1145/1806689.1806733openalex-snapshot
Multi-parameter mechanism design and sequential posted pricing
inferredcites →https://doi.org/10.1145/1807342.1807349openalex-snapshot
Truthful mechanisms with implicit payment computation
inferredcites →https://doi.org/10.1145/1807342.1807364openalex-snapshot
Revenue maximization with a single sample
inferredcites →https://doi.org/10.1145/352871.352897openalex-snapshot
Competitive analysis of incentive compatible on-line auctions
inferredcites →https://doi.org/10.1145/988772.988784openalex-snapshot
Adaptive limited-supply online auctions
inferredcites →https://doi.org/10.1184/r1/6607643openalex-snapshot
Near-Optimal Online Auctions
inferredcites →https://doi.org/10.1287/moor.6.1.58openalex-snapshot
Optimal Auction Design
inferredcites →https://doi.org/10.1287/opre.1080.0640openalex-snapshot
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
inferredcites →https://doi.org/10.1287/opre.1100.0867openalex-snapshot
On the Minimax Complexity of Pricing in a Changing Environment
inferredcites →https://doi.org/10.1561/2200000024openalex-snapshot
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
inferredcites →https://doi.org/10.2307/1912571openalex-snapshot
Efficient and Competitive Rationing
inferredcites →https://doi.org/10.2307/2982809openalex-snapshot
Multi-Armed Bandit Allocation Indices.
inferredcites →https://doi.org/10.5555/1283383.1283429openalex-snapshot
Matroids, secretary problems, and online mechanisms
inferredcites →https://doi.org/10.5555/545381.545506openalex-snapshot
Incentive-compatible online auctions for digital goods
inferredcites →https://doi.org/10.5555/644108.644143openalex-snapshot
Online learning in online auctions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.5065135openalex-extracted
The Effects of Initial Information on Macroeconomic Expectations: An Exploration-Exploitation Behavioral Framework
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_10openalex-snapshot
Pricing Multi-unit Markets
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_18openalex-snapshot
Social Welfare and Profit Maximization from Revealed Preferences
inferred← citeshttps://doi.org/10.1007/978-3-031-10989-8_16openalex-snapshot
An Incentive-Compatible and Efficient Mechanism for Matching and Pricing in Ride-Sharing
inferred← citeshttps://doi.org/10.1007/978-3-031-44505-7_5openalex-snapshot
Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing
inferred← citeshttps://doi.org/10.1007/s00186-020-00704-yopenalex-snapshot
A pricing problem with unknown arrival rate and price sensitivity
inferred← citeshttps://doi.org/10.1007/s00186-021-00744-yopenalex-snapshot
Dynamic pricing with finite price sets: a non-parametric approach
inferred← citeshttps://doi.org/10.1007/s12525-019-00355-wopenalex-snapshot
Regret under different auction designs: the case of English and Dutch auctions
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103821openalex-snapshot
Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103990openalex-snapshot
Increasing revenue in Bayesian posted price auctions through signaling
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104543openalex-snapshot
Auction design with ex post ROI constraints
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107882openalex-snapshot
Pricing and market segmentation coordination in a push–pull supply chain with sequentially observed demand
inferred← citeshttps://doi.org/10.1016/j.engappai.2023.107558openalex-snapshot
Constrained contextual bandit algorithm for limited-budget recommendation system
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.123377openalex-snapshot
A second-pricing based incentive-compatible mechanism for matching and pricing in ride-sharing
inferred← citeshttps://doi.org/10.1016/j.ifacol.2025.01.094openalex-snapshot
Relational Weight Optimization for Enhancing Team Performance in Multi-Agent Multi-Armed Bandits
inferred← citeshttps://doi.org/10.1016/j.ject.2024.10.001openalex-snapshot
Deciphering algorithmic collusion: Insights from bandit algorithms and implications for antitrust enforcement
inferred← citeshttps://doi.org/10.1017/s0269888918000061openalex-snapshot
A survey of incentive engineering for crowdsourcing
inferred← citeshttps://doi.org/10.1080/01621459.2022.2128359openalex-snapshot
Policy Optimization Using Semiparametric Models for Dynamic Pricing
inferred← citeshttps://doi.org/10.1109/ciss50987.2021.9400269openalex-snapshot
On Logarithmic Regret for Bandits with Knapsacks
inferred← citeshttps://doi.org/10.1109/focs.2019.00022openalex-snapshot
Adversarial Bandits with Knapsacks
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737511openalex-snapshot
Efficient Online Resource Allocation in Heterogeneous Clusters with Machine Variability
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796973openalex-snapshot
Online Pricing with Limited Supply and Time-Sensitive Valuations
inferred← citeshttps://doi.org/10.1109/tmc.2018.2848265openalex-snapshot
Differentially Private Mechanisms for Budget Limited Mobile Crowdsourcing
inferred← citeshttps://doi.org/10.1109/tnet.2020.3006906openalex-snapshot
Online Resource Allocation With Machine Variability: A Bandit Perspective
inferred← citeshttps://doi.org/10.1134/s199047892301009xopenalex-snapshot
Pure Nash Equilibrium in a Two-Step Pricing Game: Covering a Tourist City with Retail Outlets
inferred← citeshttps://doi.org/10.1137/20m1385718openalex-snapshot
Contextual Search via Intrinsic Volumes
inferred← citeshttps://doi.org/10.1145/2897518.2897579openalex-snapshot
Watch and learn: optimizing from revealed preferences feedback
inferred← citeshttps://doi.org/10.1145/3033274.3084095openalex-snapshot
Matching while Learning
inferred← citeshttps://doi.org/10.1145/3033274.3085106openalex-snapshot
Multidimensional Dynamic Pricing for Welfare Maximization
inferred← citeshttps://doi.org/10.1145/3033274.3085145openalex-snapshot
Online Auctions and Multi-scale Online Learning
inferred← citeshttps://doi.org/10.1145/3037382openalex-snapshot
Posting Prices with Unknown Distributions
inferred← citeshttps://doi.org/10.1145/3038912.3052700openalex-snapshot
Horizon-Independent Optimal Pricing in Repeated Auctions with Truthful and Strategic Buyers
inferred← citeshttps://doi.org/10.1145/3084041.3084058openalex-snapshot
Online Pricing for Mobile Crowdsourcing with Multi-Minded Users
inferred← citeshttps://doi.org/10.1145/3183713.3196929openalex-snapshot
Dynamic Pricing in Spatial Crowdsourcing
inferred← citeshttps://doi.org/10.1145/3299873openalex-snapshot
Bandits and Experts in Metric Spaces
inferred← citeshttps://doi.org/10.1145/3373715openalex-snapshot
Pricing Multi-Unit Markets
inferred← citeshttps://doi.org/10.1145/3434423openalex-snapshot
Optimal Pricing for MHR and λ-regular Distributions
inferred← citeshttps://doi.org/10.1145/3465456.3467645openalex-snapshot
A Regret Analysis of Bilateral Trade
inferred← citeshttps://doi.org/10.1145/3485447.3512060openalex-snapshot
Truthful Online Scheduling of Cloud Workloads under Uncertainty
inferred← citeshttps://doi.org/10.1145/3557045openalex-snapshot
Adversarial Bandits with Knapsacks
inferred← citeshttps://doi.org/10.1146/annurev-control-053018-023634openalex-snapshot
A Perspective on Incentive Design: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1155/2019/6567952openalex-snapshot
Two‐Period Dynamic versus Fixed‐Ratio Pricing Policies under Duopoly Competition
inferred← citeshttps://doi.org/10.1287/mnsc.2019.3485openalex-snapshot
Feature-Based Dynamic Pricing
inferred← citeshttps://doi.org/10.1287/mnsc.2021.4216openalex-snapshot
Inventory Balancing with Online Learning
inferred← citeshttps://doi.org/10.1287/moor.2022.0086openalex-snapshot
Network Revenue Management with Nonparametric Demand Learning: T-Regret and Polynomial Dimension Dependency
inferred← citeshttps://doi.org/10.1287/moor.2023.1351openalex-snapshot
Bilateral Trade: A Regret Minimization Perspective
inferred← citeshttps://doi.org/10.1287/opre.2020.2013openalex-snapshot
Matching While Learning
inferred← citeshttps://doi.org/10.1287/opre.2020.2048openalex-snapshot
On Policies for Single-Leg Revenue Management with Limited Demand Information
inferred← citeshttps://doi.org/10.1287/opre.2020.2087openalex-snapshot
Deals or No Deals: Contract Design for Online Advertising
inferred← citeshttps://doi.org/10.1287/opre.2021.2205openalex-snapshot
Bayesian Exploration: Incentivizing Exploration in Bayesian Games
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16497openalex-snapshot
Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16713openalex-snapshot
Online Posted Pricing with Unknown Time-Discounted Valuations
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20424openalex-snapshot
Signaling in Posted Price Auctions
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25512openalex-snapshot
An Improved Approximation Algorithm for Wage Determination and Online Task Allocation in Crowd-Sourcing
inferred← citeshttps://doi.org/10.1613/jair.4940openalex-snapshot
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
inferred← citeshttps://doi.org/10.2139/ssrn.2334429openalex-snapshot
Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions
inferred← citeshttps://doi.org/10.2139/ssrn.2737045openalex-snapshot
Feature-Based Dynamic Pricing
inferred← citeshttps://doi.org/10.2139/ssrn.3236533openalex-snapshot
Inventory Balancing with Online Learning
inferred← citeshttps://doi.org/10.2139/ssrn.3430156openalex-snapshot
Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
inferred← citeshttps://doi.org/10.2139/ssrn.3922825openalex-snapshot
Policy Optimization Using Semiparametric Models for Dynamic Pricing
inferred← citeshttps://doi.org/10.24963/ijcai.2022/254openalex-snapshot
Online Matching with Controllable Rewards and Arrival Probabilities
inferred← citeshttps://doi.org/10.3233/web-230401openalex-snapshot
Truthful mechanisms to maximize the social welfare in real-time ride-sharing
inferred← citeshttps://doi.org/10.54254/2755-2721/37/20230497openalex-snapshot
Survey of dynamic pricing based on Multi-Armed Bandit algorithms
inferred← citeshttps://doi.org/10.54932/iwpg7510openalex-snapshot
Deciphering Algorithmic Collusion: Insights from Bandit Algorithms and Implications for Antitrust Enforcement
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.