Antje Bjelde

Antje Bjelde
  • Dr. rer. nat.
  • Researcher at Charité Universitätsmedizin Berlin

About

8
Publications
672
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
107
Citations
Current institution
Charité Universitätsmedizin Berlin
Current position
  • Researcher
Additional affiliations
June 2022 - present
Charité Universitätsmedizin Berlin
Position
  • Research Assistant
June 2014 - May 2018
Technische Universität Berlin
Position
  • Researcher
July 2022 - present
German Rheumatism Research Centre
Position
  • Researcher

Publications

Publications (8)
Article
The computational capabilities of neuronal networks are fundamentally constrained by their specific connectivity. Previous studies of cortical connectivity have mostly been carried out in rodents; whether the principles established therein also apply to the evolutionarily expanded human cortex is unclear. We studied network properties within the hu...
Article
We consider the online traveling salesperson problem (TSP), where requests appear online over time on the real line and need to be visited by a server initially located at the origin. We distinguish between closed and open online TSP, depending on whether the server eventually needs to return to the origin or not. While online TSP on the line is a...
Article
Zusammenfassung Der Gewinn eines großen Turniers, wie zum Beispiel der Fußballweltmeisterschaft, hängt nicht nur von dem eigenen Können, sondern auch von der Reihenfolge der Spiele und Gegner ab. Wie diese Reihenfolge „gut“ gewählt werden kann, kann mit Mechanismusdesign, einem Teilgebiet der Spieltheorie, modelliert werden. Die Fußballweltmeisters...
Article
We study mechanisms that select members of a set of agents based on nominations by other members and that are impartial in the sense that agents cannot influence their own chance of selection. Prior work has shown that deterministic mechanisms for selecting any fixed number k of agents are severely limited and cannot extract a constant fraction of...
Conference Paper
We study general resource allocation problems with a diseconomy of scale. Given a finite set of commodities that request certain resources, the cost of each resource grows superlinearly with the demand for it, and our goal is to minimize the total cost of the resources. In large systems with limited coordination, it is natural to consider local dyn...
Conference Paper
Full-text available
We consider the online traveling salesperson problem (TSP), where requests appear online over time on the real line and need to be visited by a server initially located at the origin. We distinguish between closed and open online TSP, depending on whether the server eventually needs to return to the origin or not. While online TSP on the line is a...
Conference Paper
We study mechanisms that select members of a set of agents based on nominations by other members and that are impartial in the sense that agents cannot influence their own chance of selection. Prior work has shown that deterministic mechanisms for selecting any fixed number of agents are severely limited, whereas randomization allows for the select...

Network

Cited By