Network winner determination problem

MaRDI QIDQ5219582zbMATH OpenFDO

Authors Mariusz Kaleta

Publication date 12 March 2020

zbMATH Keywords

complexity of the NWDPgraph modelsMILP modelsmulti-commodity flow optimizationnetwork auctionsnetwork winner determination problem (NWDP)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Optimization issues in combinatorial auctions
• On computational complexity of the electric power flow optimization problem in market environment
• scientific article; zbMATH DE number 1560336
• Optimization of transmission systems for chain-type markets
• On heuristics for solving winner determination problem in combinatorial auctions

Cited in

(2)

• A hybrid ant colony algorithm for the winner determination problem
• Condorcet winner configurations of linear networks

This page was built for publication: Network winner determination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219582)