47 citations · 72 across the 9 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2022
Optimal Parametrization of the Gale-Shapley Preallocation Method for Combinatorial Auction-based Channel Assignment
Dávid Csercsik, Eduard Jorswieck
Algorithms based on combinatorial auctions show significant potential regarding their application for channel assignment problems in multi-connectivity ultra-reliable wireless netw…
cs.GT2021★ 12 cited
Preallocation-based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks
Dávid Csercsik, Eduard Jorswieck
We consider a general multi-connectivity framework, intended for ultra-reliable low-latency communications (URLLC) services, and propose a novel, preallocation-based combinatorial…
cs.GT2020
Bid-aggregation based clearing of day-ahead electricity markets
Botond Feczkó, Dániel Divényi, Ádám Sleisz +1
In this work we propose a heuristic clearing method of day-ahead electricity markets. In the first part of the process, a computationally less demanding problem is solved using an…