Reverse auctions with transportation and convex costs

Benjamin Heymann () and Alejandro Jofré ()
Additional contact information
Benjamin Heymann: Criteo
Alejandro Jofré: Universidad de Chile

Computational Management Science, 2024, vol. 21, issue 1, No 20, 18 pages

Abstract: Abstract We discuss a procurement problem with transportation losses and piecewise linear production costs. We first provide an algorithm based on Knaster-Tarski’s fixed point theorem to solve the allocation problem in the quadratic losses case. We then identify a monotony condition on the types distribution under which the Bayesian cost minimizing mechanism takes a simple form.

Keywords: Optimal auctions; Multidimensional mechanism; Allocation algorithm; Electricity markets; Fixed point (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10287-023-00498-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00498-4

Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2

DOI: 10.1007/s10287-023-00498-4

Access Statistics for this article

Computational Management Science is currently edited by Ruediger Schultz

More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().