Author image not provided
 Antje Bjelde

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.00
Citation Count0
Publication count3
Publication years2015-2017
Available for download2
Average downloads per article45.50
Downloads (cumulative)91
Downloads (12 Months)91
Downloads (6 Weeks)21
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


4 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 4 of 4
Sort by:

1 published by ACM
December 2017 ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 7,   Downloads (Overall): 7

Full text available: PDFPDF
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 ...
Keywords: Mechanism design, impartial selection

2 published by ACM
July 2017 SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 40,   Downloads (Overall): 40

Full text available: PDFPDF
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 ...
Keywords: congestion games, distributed algorithm, locality gap, approximation algorithm, energy efficiency

3
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 10,   Downloads (Overall): 10

Full text available: PDFPDF
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 ...

4
December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

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, ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us