Pricing and clearing combinatorial markets with singleton and swap orders

@article{Mller2017PricingAC,
  title={Pricing and clearing combinatorial markets with singleton and swap orders},
  author={J. M{\"u}ller and Sebastian Pokutta and A. Martin and S. Pape and A. Peter and T. Winter},
  journal={Mathematical Methods of Operations Research},
  year={2017},
  volume={85},
  pages={155-177}
}
  • J. Müller, Sebastian Pokutta, +3 authors T. Winter
  • Published 2017
  • Mathematics, Computer Science
  • Mathematical Methods of Operations Research
  • In this article we consider combinatorial markets with valuations only for singletons and pairs of buy/sell-orders for swapping two items in equal quantity. We provide an algorithm that permits polynomial time market-clearing and -pricing. The results are presented in the context of our main application: the futures opening auction problem. Futures contracts are an important tool to mitigate market risk and counterparty credit risk. In futures markets these contracts can be traded with varying… CONTINUE READING

    Figures and Tables from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES
    A polynomial time primal network simplex algorithm for minimum cost flows
    • J. Orlin
    • Computer Science, Mathematics
    • 1996
    188
    Combinatorial Auctions
    951
    Combinatorial Auctions: A Survey
    1046
    Convex Optimization
    34381
    Integral Boundary Points of Convex Polyhedra
    212