no code implementations • 26 Jan 2024 • Jakub Svoboda, Soham Joshi, Josef Tkadlec, Krishnendu Chatterjee
Amplifiers of selection are networks that increase the fixation probability of advantageous mutants, as compared to the unstructured fully-connected network.
no code implementations • 5 Aug 2023 • David A. Brewster, Martin A. Nowak, Josef Tkadlec
Third, we identify a broad class of directed graphs with fast fixation times for any $r\ge 1$.
no code implementations • 27 Jul 2023 • Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Đorđe Žikelić
We consider, for the first time, {\em poorman discrete-bidding} in which the granularity of the bids is restricted and the higher bid is paid to the bank.
no code implementations • 12 Apr 2023 • Josef Tkadlec, Christian Hilbe, Martin A. Nowak
But high levels of cooperation evolve only if the benefit-to-cost ratio exceeds a certain threshold that depends on memory length.
no code implementations • 20 Jan 2022 • Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec
We show that the problem is NP-hard for both $r>1$ and $r<1$, while the latter case is also inapproximable within any multiplicative factor.
no code implementations • 21 Nov 2021 • Josef Tkadlec, Kamran Kaveh, Krishnendu Chatterjee, Martin A. Nowak
Finally, we show that for low-dimensional lattices, the effect of altered motility is comparable to that of altered fitness: in the limit of large population size, the invader's fixation probability is either constant or exponentially small, depending on whether it is more or less motile than the resident.
no code implementations • 11 Jan 2021 • Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber
We show that for any two labeled convex sets of $n$ points there exists a compatible matching with $\lfloor \sqrt {2n}\rfloor$ edges.
Computational Geometry
no code implementations • 19 Nov 2019 • Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec
On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio.