- Tytuł:
- Network winner determination problem
- Autorzy:
- Kaleta, M.
- Powiązania:
- https://bibliotekanauki.pl/articles/229592.pdf
- Data publikacji:
- 2018
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
network auctions
network winner determination problem (NWDP)
complexity of the NWDP
MILP models
multi-commodity flow optimization
graph models - Opis:
- Many real-world marketplaces involve some additional constraints to be addressed during the market clearing process. This is the case of various infrastructure sectors of the economy, where market commodities are associated with some elements of the infrastructure, e.g., elements of telecommunication, power transmission or transportation network. Transactions are allowed only if the infrastructure, modeled as a flow network, is able to serve them. Determination of the best offers is possible by solving the optimization problem, so called the Winner Determination Problem (WDP). We consider a new subclass of the WDP, i.e., the Network Winner Determination Problem (NWDP). We characterize different poblems in the NWDP class and analyze their computational complexity. The sharp edge of tractability for NWDP-derived problems is generally designated by integer offers. However, we show that some specific settings of the problem can still be solved in polytime. We also presents ome exemplary applications of NWDP in telecommunication bandwidth market and electrical energy balancing market.
- Źródło:
-
Archives of Control Sciences; 2018, 28, 1; 51-88
1230-2384 - Pojawia się w:
- Archives of Control Sciences
- Dostawca treści:
- Biblioteka Nauki
Artykuł