A preference-based, multi-unit auction for pricing and capacity allocation
type: Item
instance of: scholarly article
title: A preference-based, multi-unit auction for pricing and capacity allocation
zbMATH Open document ID: 1394.91166
author: Javad Lessan
author: Selçuk Karabatı
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/8206
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6901561
zbMATH Keywords: multi-unit auctions
zbMATH Keywords: pricing and capacity allocation
zbMATH Keywords: mixed-integer programming
MaRDI profile type: Publication
OpenAlex ID: W2760415932
cites work: Ascending price Vickrey auctions
cites work: Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance
cites work: Optimal Pricing in Networks with Externalities
cites work: Technical Note—Capacity Allocation Under Retail Competition: Uniform and Competitive Allocations
cites work: What money can't buy: efficient mechanism design with costly signals
cites work: On the Power of Randomization in Algorithmic Mechanism Design
cites work: Truthful and Near-Optimal Mechanism Design via Linear Programming
cites work: Equilibrium analysis of capacity allocation with demand competition
cites work: Multi-item Vickrey-Dutch auctions
cites work: Understanding auctions
cites work: An Efficient Multi-Unit Ascending Auction
cites work: The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
DOI: 10.1016/J.COR.2017.09.024
description: scientific article; zbMATH DE number 6901561