1 citations · 1 across the 3 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.NE2023
Run Time Bounds for Integer-Valued OneMax Functions
Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li +1
While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space . This is a further ge…
cs.GT2023★ 1 cited
Strategic Resource Selection with Homophilic Agents
Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner +1
The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, ag…