Winner determination in geometrical combinatorial auctions

DOI10.1016/j.ejor.2016.08.037zbMath1380.91086OpenAlexW2348657693MaRDI QIDQ1698906

Frits C. R. Spieksma, Dries R. Goossens, Bart Vangerven

Publication date: 16 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/8058943

zbMATH Keywords

complexitydynamic programmingauctionswinner determination problemrows

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

A hybrid ant colony algorithm for the winner determination problem, The cross-entropy method for the winner determination problem in combinatorial auctions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for maximum independent set of pseudo-disks
• Reconstructing sets of orthogonal line segments in the plane
• Interval scheduling and colorful independent sets
• Computationally-feasible truthful auctions for convex bundles
• On the approximability of an interval scheduling problem
• On the computational complexity of 2-interval pattern matching problems
• Combinatorial auctions
• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• Generalized planar matching
• Approximation schemes for covering and packing problems in image processing and VLSI
• Algorithmic Game Theory
• Scheduling Split Intervals
• Algorithm for optimal winner determination in combinatorial auctions