On the public citation graph

Online auctions with re-usable goods

https://doi.org/10.1145/1064009.1064027
0 signed · 151 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/3-540-36494-3_53openalex-snapshot
The Price of Truth: Frugality in Truthful Mechanisms
inferredcites →https://doi.org/10.1007/978-1-4684-9277-4_6openalex-snapshot
Linear Programming and Vickrey Auctions
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_17openalex-snapshot
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
inferredcites →https://doi.org/10.1007/s00453-003-1025-6openalex-snapshot
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.012openalex-snapshot
Online learning in online auctions
inferredcites →https://doi.org/10.1109/sfcs.2001.959924openalex-snapshot
Truthful mechanisms for one-parameter agents
inferredcites →https://doi.org/10.1109/sfcs.2003.1238230openalex-snapshot
Towards a characterization of truthful combinatorial auctions
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.1145/352871.352897openalex-snapshot
Competitive analysis of incentive compatible on-line auctions
inferredcites →https://doi.org/10.1145/380752.380847openalex-snapshot
Buffer overflow management in QoS switches
inferredcites →https://doi.org/10.1145/585265.585266openalex-snapshot
Truth revelation in approximately efficient combinatorial auctions
inferredcites →https://doi.org/10.1145/779928.779977openalex-snapshot
Virtual worlds
inferredcites →https://doi.org/10.1145/779928.779978openalex-snapshot
Pricing WiFi at Starbucks
inferredcites →https://doi.org/10.1145/780542.780616openalex-snapshot
Reducing truth-telling online mechanisms to online optimization
inferredcites →https://doi.org/10.1145/988772.988783openalex-snapshot
Mechanism design for online real-time scheduling
inferredcites →https://doi.org/10.1145/988772.988784openalex-snapshot
Adaptive limited-supply online auctions
inferredcites →https://doi.org/10.5555/1070432.1070596openalex-snapshot
Online ascending auctions for gradually expiring items
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.2176028openalex-extracted
A Dynamic Mechanism Design for Scheduling with Different Use Lengths
inferred← citeshttps://doi.org/10.2139/ssrn.4046421openalex-extracted
The Loss of Serving in the Dark
inferred← citeshttps://doi.org/10.1002/9780470455432.ch3openalex-snapshot
Ownership and Decentralization Issues in Resource Allocation Mechanisms
inferred← citeshttps://doi.org/10.1002/wcm.2411openalex-snapshot
TRADE: A truthful online combinatorial auction for spectrum allocation in cognitive radio networks
inferred← citeshttps://doi.org/10.1007/11786986_52openalex-snapshot
New Constructions of Mechanisms with Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-85947-3openalex-snapshot
Algorithmic Game Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-13987-6_2openalex-snapshot
Manipulating Information Providers Access to Information in Auctions
inferred← citeshttps://doi.org/10.1007/978-3-319-29691-3_5openalex-snapshot
Online Spectrum Allocation Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_1openalex-snapshot
Clairvoyant Mechanisms for Online Auctions
inferred← citeshttps://doi.org/10.1007/978-3-319-54229-4_1openalex-snapshot
Strategic Free Information Disclosure for a Vickrey Auction
inferred← citeshttps://doi.org/10.1007/978-3-319-66700-3_3openalex-snapshot
Online Random Sampling for Budgeted Settings
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_65openalex-snapshot
Characterizing Truthful Market Design
inferred← citeshttps://doi.org/10.1007/978-3-540-88713-3_1openalex-snapshot
On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values
inferred← citeshttps://doi.org/10.1007/978-3-540-92185-1_36openalex-snapshot
Anonymity-Proof Voting Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_9openalex-snapshot
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_5openalex-snapshot
Truthful Mechanisms via Greedy Iterative Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-03821-1openalex-snapshot
Auctions, Market Mechanisms and Their Applications : First International ICST Conference, AMMA 2009, Boston, MA, USA, May 8-9, 2009, Revised Selected Papers
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_34openalex-snapshot
Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
inferred← citeshttps://doi.org/10.1007/978-3-642-30913-7_22openalex-snapshot
An Online Mechanism for Multi-speed Electric Vehicle Charging
inferred← citeshttps://doi.org/10.1007/978-3-642-31869-6_6openalex-snapshot
SHIELD: A Strategy-Proof and Highly Efficient Channel Auction Mechanism for Multi-radio Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39701-1_11openalex-snapshot
SAFE: A Strategy-Proof Auction Mechanism for Multi-radio, Multi-channel Spectrum Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-39701-1_42openalex-snapshot
Truthful Online Reverse Auction with Flexible Preemption for Access Permission Transaction in Macro-Femtocell Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_53openalex-snapshot
The Temp Secretary Problem
inferred← citeshttps://doi.org/10.1007/s00182-013-0405-7openalex-snapshot
Efficiency levels in sequential auctions with dynamic arrivals
inferred← citeshttps://doi.org/10.1007/s00199-020-01308-7openalex-snapshot
Prior-free online mechanisms for queueing with arrivals
inferred← citeshttps://doi.org/10.1007/s00224-019-09918-yopenalex-snapshot
Online Random Sampling for Budgeted Settings
inferred← citeshttps://doi.org/10.1007/s00779-013-0708-5openalex-snapshot
A truthful auction mechanism for channel allocation in multi-radio, multi-channel non-cooperative wireless networks
inferred← citeshttps://doi.org/10.1007/s10586-021-03499-7openalex-snapshot
A truthful online mechanism for virtual machine provisioning and allocation in clouds
inferred← citeshttps://doi.org/10.1007/s11227-015-1567-9openalex-snapshot
An online greedy allocation of VMs with non-increasing reservations in clouds
inferred← citeshttps://doi.org/10.1016/j.artint.2009.01.002openalex-snapshot
An options-based solution to the sequential auction problem
inferred← citeshttps://doi.org/10.1016/j.artint.2014.05.008openalex-snapshot
On the choice of obtaining and disclosing the common value in auctions
inferred← citeshttps://doi.org/10.1016/j.geb.2008.06.007openalex-snapshot
Worst-case optimal redistribution of VCG payments in multi-unit auctions
inferred← citeshttps://doi.org/10.1016/j.geb.2013.07.004openalex-snapshot
The Dynamic Vickrey Auction
inferred← citeshttps://doi.org/10.1016/j.geb.2015.01.004openalex-snapshot
Auctions with online supply
inferred← citeshttps://doi.org/10.1016/j.jet.2014.07.010openalex-snapshot
Online ascending auctions for gradually expiring items
inferred← citeshttps://doi.org/10.1016/j.sorms.2011.09.003openalex-snapshot
Dynamic mechanism design
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.057openalex-snapshot
Truthful algorithms for scheduling selfish tasks on parallel machines
inferred← citeshttps://doi.org/10.1080/0740817x.2016.1213467openalex-snapshot
Online scheduling and pricing for electric vehicle charging
inferred← citeshttps://doi.org/10.1109/ccgrid.2010.57openalex-snapshot
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
inferred← citeshttps://doi.org/10.1109/dyspan.2010.5457907openalex-snapshot
Strategies to Achieve Truthful Spectrum Auctions for Cognitive Radio Networks Based on Mechanism Design
inferred← citeshttps://doi.org/10.1109/gcaiot63427.2024.10833590openalex-snapshot
Auction-Based Scheduling for Efficient Execution of Stochastic Tasks in Diverse Vehicular Clouds with Flexible Time Datacenter Integration
inferred← citeshttps://doi.org/10.1109/icc.2015.7249538openalex-snapshot
Online spectrum auction in cognitive radio networks with uncertain activities of primary users
inferred← citeshttps://doi.org/10.1109/icccn.2016.7568591openalex-snapshot
Truthful Online Double Auctions with Real-Time Stochastic Arrival of Demand and Supply
inferred← citeshttps://doi.org/10.1109/iccect57938.2023.10141016openalex-snapshot
Auction Pricing for Bandwidth across Multiple Datacenters with Traffic Engineering
inferred← citeshttps://doi.org/10.1109/icdcsw.2006.116openalex-snapshot
WS-Auction: Mechanism Design for aWeb Services Market
inferred← citeshttps://doi.org/10.1109/iceca55336.2022.10009518openalex-snapshot
A State-of-the-Art Approach for Securing Online Auction System
inferred← citeshttps://doi.org/10.1109/icnp.2014.45openalex-snapshot
Fair Pricing in the Sky: Truthful Frequency Allocation with Dynamic Spectrum Supply
inferred← citeshttps://doi.org/10.1109/iecon.2013.6699890openalex-snapshot
Semantically-enriched electric car recharge optimization toolkit for load control
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935036openalex-snapshot
To preempt or not: Tackling bid and time-based cheating in online spectrum auctions
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566884openalex-snapshot
Maximizing social welfare in operator-based Cognitive Radio Networks under spectrum uncertainty and sensing inaccuracy
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566946openalex-snapshot
A framework for truthful online auctions in cloud computing with heterogeneous user demands
inferred← citeshttps://doi.org/10.1109/infcomw.2012.6193489openalex-snapshot
Truthful prioritization schemes for spectrum sharing
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218425openalex-snapshot
Online procurement auctions for resource pooling in client-assisted cloud storage systems
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218592openalex-snapshot
Truthful online double auctions for dynamic mobile crowdsourcing
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524549openalex-snapshot
Incentive mechanism for proximity-based Mobile Crowd Service systems
inferred← citeshttps://doi.org/10.1109/iwqos.2018.8624184openalex-snapshot
Competitive Online Scheduling Algorithms with Applications in Deadline-Constrained EV Charging
inferred← citeshttps://doi.org/10.1109/jsac.2011.110416openalex-snapshot
On a Truthful Mechanism for Expiring Spectrum Sharing in Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/jsac.2017.2659259openalex-snapshot
Online Stochastic Buy-Sell Mechanism for VNF Chains in the NFV Market
inferred← citeshttps://doi.org/10.1109/jsac.2021.3065078openalex-snapshot
Strategy-Proof Online Mechanisms for Weighted AoI Minimization in Edge Computing
inferred← citeshttps://doi.org/10.1109/msn60784.2023.00035openalex-snapshot
Toward Quality-Aware Reverse Auction-based Incentive Mechanism for Federated Learning
inferred← citeshttps://doi.org/10.1109/noms.2018.8406240openalex-snapshot
A truthful online auction mechanism for deadline-aware cloud resource allocation
inferred← citeshttps://doi.org/10.1109/sm57895.2023.10112493openalex-snapshot
ADAM: An Auction-based Datacenter Management in Vehicular Cloud
inferred← citeshttps://doi.org/10.1109/tc.2015.2419658openalex-snapshot
Truthful Scheduling Mechanisms for Powering Mobile Crowdsensing
inferred← citeshttps://doi.org/10.1109/tc.2015.2435784openalex-snapshot
A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands
inferred← citeshttps://doi.org/10.1109/tc.2015.2444843openalex-snapshot
An Online Mechanism for Resource Allocation and Pricing in Clouds
inferred← citeshttps://doi.org/10.1109/tccn.2017.2669997openalex-snapshot
Bid and Time Truthful Online Auctions in Dynamic Spectrum Markets
inferred← citeshttps://doi.org/10.1109/tits.2018.2887194openalex-snapshot
Online EV Charging Scheduling With On-Arrival Commitment
inferred← citeshttps://doi.org/10.1109/tkde.2025.3613148openalex-snapshot
Online Billboard Auction With Social Welfare Maximization
inferred← citeshttps://doi.org/10.1109/tmc.2016.2609425openalex-snapshot
THEMIS: Collusion-Resistant and Fair Pricing Spectrum Auction Under Dynamic Supply
inferred← citeshttps://doi.org/10.1109/tmc.2020.3034499openalex-snapshot
On Designing Strategy-Proof Budget Feasible Online Mechanisms for Mobile Crowdsensing With Time-Discounting Values
inferred← citeshttps://doi.org/10.1109/tsc.2021.3132792openalex-snapshot
A Multi-Market Trading Framework for Low-Latency Service Provision at the Edge of Networks
inferred← citeshttps://doi.org/10.1109/tvt.2021.3086179openalex-snapshot
Online Resource Auction for EAVN With Non-Price Attributes
inferred← citeshttps://doi.org/10.1109/twc.2016.2621765openalex-snapshot
Spectrum Auction for Differential Secondary Wireless Service Provisioning With Time-Dependent Valuation Information
inferred← citeshttps://doi.org/10.1109/wi-iat.2012.200openalex-snapshot
Evaluation of Parking Reservation System with Auction Including Electricity Trading
inferred← citeshttps://doi.org/10.1137/1.9781611975482.119openalex-snapshot
Pricing for Online Resource Allocation: Intervals and Paths
inferred← citeshttps://doi.org/10.1142/9789812773470_0014openalex-snapshot
EGG: AN EXTENSIBLE AND ECONOMICS-INSPIRED OPEN GRID COMPUTING PLATFORM
inferred← citeshttps://doi.org/10.1145/1134707.1134727openalex-snapshot
The sequential auction problem on eBay
inferred← citeshttps://doi.org/10.1145/1183907.1183913openalex-snapshot
Online algorithms for market clearing
inferred← citeshttps://doi.org/10.1145/1250910.1250915openalex-snapshot
Worst-case optimal redistribution of VCG payments
inferred← citeshttps://doi.org/10.1145/1329125.1329260openalex-snapshot
Online auctions for bidders with interdependent values
inferred← citeshttps://doi.org/10.1145/1367497.1367522openalex-snapshot
Dynamic cost-per-action mechanisms and applications to online advertising
inferred← citeshttps://doi.org/10.1145/1566374.1566387openalex-snapshot
Self-correcting sampling-based dynamic multi-unit auctions
inferred← citeshttps://doi.org/10.1145/1566374.1566403openalex-snapshot
A qualitative vickrey auction
inferred← citeshttps://doi.org/10.1145/1721837.1721851openalex-snapshot
Dynamic pricing for impatient bidders
inferred← citeshttps://doi.org/10.1145/1807342.1807345openalex-snapshot
Auctions with online supply
inferred← citeshttps://doi.org/10.1145/2312005.2312051openalex-snapshot
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
inferred← citeshttps://doi.org/10.1145/2486159.2486187openalex-snapshot
Efficient online scheduling for deadline-sensitive jobs
inferred← citeshttps://doi.org/10.1145/2488388.2488489openalex-snapshot
Pricing mechanisms for crowdsourcing markets
inferred← citeshttps://doi.org/10.1145/2488608.2488729openalex-snapshot
The loss of serving in the dark
inferred← citeshttps://doi.org/10.1145/2632951.2632956openalex-snapshot
Truthful prioritization for dynamic bandwidth sharing
inferred← citeshttps://doi.org/10.1145/2764468.2764535openalex-snapshot
Truthful Online Scheduling with Commitments
inferred← citeshttps://doi.org/10.1145/2934872.2934893openalex-snapshot
Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers
inferred← citeshttps://doi.org/10.1145/3033274.3085119openalex-snapshot
Truth and Regret in Online Scheduling
inferred← citeshttps://doi.org/10.1145/3055399.3055455openalex-snapshot
Stability of service under time-of-use pricing
inferred← citeshttps://doi.org/10.1145/3309697.3331519openalex-snapshot
The Segmentation-Thickness Tradeoff in Online Marketplaces
inferred← citeshttps://doi.org/10.1145/3322205.3311089openalex-snapshot
The Segmentation-Thickness Tradeoff in Online Marketplaces
inferred← citeshttps://doi.org/10.1145/3479722.3480991openalex-snapshot
Dynamic posted-price mechanisms for the blockchain transaction-fee market
inferred← citeshttps://doi.org/10.1145/3816782.3819186openalex-snapshot
Lossless Robustification of Packet Scheduling Algorithms
inferred← citeshttps://doi.org/10.1184/r1/6603722openalex-snapshot
Automated Online Mechanism Design and Prophet Inequalities
inferred← citeshttps://doi.org/10.1201/9781584888215-c16openalex-snapshot
Auction Protocols
inferred← citeshttps://doi.org/10.1287/moor.2013.0595openalex-snapshot
Optimal Dynamic Auctions and Simple Index Rules
inferred← citeshttps://doi.org/10.1287/opre.1090.0732openalex-snapshot
Mechanism Design for Decentralized Online Machine Scheduling
inferred← citeshttps://doi.org/10.1287/opre.1120.1124openalex-snapshot
Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8801openalex-snapshot
A Strategy-Proof Online Auction with Time Discounting Values
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10609openalex-snapshot
Strategic Signaling and Free Information Disclosure in Auctions
inferred← citeshttps://doi.org/10.1609/aimag.v31i4.2316openalex-snapshot
Dynamic Incentive Mechanisms
inferred← citeshttps://doi.org/10.1613/jair.2303openalex-snapshot
Chain: A Dynamic Double Auction Framework for Matching Patient Agents
inferred← citeshttps://doi.org/10.1613/jair.4064openalex-snapshot
An Online Mechanism for Multi-Unit Demand and its Application to Plug-in Hybrid Electric Vehicle Charging
inferred← citeshttps://doi.org/10.1613/jair.5100openalex-snapshot
Efficient Mechanism Design for Online Scheduling
inferred← citeshttps://doi.org/10.24963/ijcai.2017/707openalex-snapshot
Efficient Mechanism Design for Online Scheduling (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/ijcai.2018/61openalex-snapshot
Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations
inferred← citeshttps://doi.org/10.2991/iceeim-14.2014.80openalex-snapshot
Research of Private Cloud Resource Allocation with Multi-type User Based on Online Mechanism Design
inferred← citeshttps://doi.org/10.3233/aic-220127openalex-snapshot
From intelligent agents to trustworthy human-centred multiagent systems
inferred← citeshttps://doi.org/10.4230/dagsemproc.07271.4openalex-snapshot
Anonymity-Proof Voting Rules
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.716openalex-snapshot
The Returning Secretary
inferred← citeshttps://doi.org/10.4230/oasics.tokenomics.2021.6openalex-snapshot
Dynamic Posted-Price Mechanisms for the Blockchain Transaction Fee Market (Invited Talk)
inferred← citeshttps://doi.org/10.48550/arxiv.0905.3429openalex-snapshot
Auctions with Online Supply
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1360openalex-snapshot
Models for Truthful Online Double Auctions
inferred← citeshttps://doi.org/10.48550/arxiv.1403.1896openalex-snapshot
Online Mechanism Design for Cloud Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0614openalex-snapshot
The secretary returns
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06819openalex-snapshot
Auction-based Incentive Mechanisms for Dynamic Mobile Ad-Hoc Crowd Service
inferred← citeshttps://doi.org/10.48550/arxiv.1504.03625openalex-snapshot
Truthful Secretaries with Budgets
inferred← citeshttps://doi.org/10.48550/arxiv.1506.09208openalex-snapshot
Improved Competitive Analysis of Online Scheduling Deadline-Sensitive Jobs
inferred← citeshttps://doi.org/10.48550/arxiv.1704.02364openalex-snapshot
Stability of Service under Time-of-Use Pricing
inferred← citeshttps://doi.org/10.53846/goediss-5046openalex-snapshot
Online Resource Management
inferred← citeshttps://doi.org/10.5555/1283383.1283400openalex-snapshot
Equilibria in online games
inferred← citeshttps://doi.org/10.5555/1496770.1496908openalex-snapshot
Online story scheduling in web advertising
inferred← citeshttps://doi.org/10.5555/1838206.1838537openalex-snapshot
Characterization of false-name-proof social choice mechanisms
inferred← citeshttps://doi.org/10.5555/2343776.2343804openalex-snapshot
False-name-proofness in online mechanisms
inferred← citeshttps://doi.org/10.5555/3091125.3091128openalex-snapshot
On AI, Markets and Machine Learning
inferred← citeshttps://doi.org/10.65109/wvox6980openalex-snapshot
Social Distancing via Social Scheduling
inferred← citeshttps://doi.org/10.65109/yjvm3580openalex-snapshot
Price-based Online Mechanisms for Settings with Uncertain Future Procurement Costs and Multi-unit Demand
inferred← citeshttps://doi.org/10.70675/51170576zc49ez4d22z9fd9z1815c558880eopenalex-snapshot
Optimal resource allocation strategies for electric vehicles in smart grids
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.