Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Aleck Johnsen"'
Publikováno v:
Proceedings of the 23rd ACM Conference on Economics and Computation.
Firms engaged in electronic commerce increasingly rely on predictive analytics via machine-learning algorithms to drive a wide array of managerial decisions. The tuning of many standard machine learning algorithms can be understood as trading off bia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eea8c25fba9ce5d6e37a10dced566dd4
https://doi.org/10.1145/3490486.3538248
https://doi.org/10.1145/3490486.3538248
Publikováno v:
FOCS
This paper compares two leading approaches for robust optimization in the models of online algorithms and mechanism design. Competitive analysis compares the performance of an online algorithm to an offline benchmark in worst-case over inputs, and pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::081c73d2ac5ea07bfc0a4ffbebc29acf
https://doi.org/10.1109/focs46700.2020.00036
https://doi.org/10.1109/focs46700.2020.00036
Publikováno v:
FOCS
A rich class of mechanism design problems can be understood as incomplete-information games between a principal who commits to a policy and an agent who responds, with payoffs determined by an unknown state of the world. Traditionally, these models r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0196432a1a65b2b1dfe4565d9074974
http://arxiv.org/abs/2009.05518
http://arxiv.org/abs/2009.05518
Publikováno v:
EC
This paper gives a theoretical model for design and analysis of mechanisms for online marketplaces where a bidding dashboard enables the bid-optimization of long-lived agents. We assume that a good allocation algorithm exists when given the true valu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::956f3969c95aafa49e3ebe59fe0c7c74
Publikováno v:
Journal of Combinatorial Optimization. 33:496-529
Patterned self-assembly tile set synthesis (pats) aims at minimizing the number of distinct DNA tile types used to self-assemble a given rectangular color pattern. For an integer k, k-pats is the subproblem of pats that restricts input patterns to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::069c072035e3b541151a64fe2f49f9d7
https://doi.org/10.1007/s10878-015-9975-6
https://doi.org/10.1007/s10878-015-9975-6
Publikováno v:
Algorithms and Computation ISBN: 9783642450297
ISAAC
ISAAC
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular pattern. For k ≥ 1, k-PATS is a variant of PATS that restricts input patterns to those with at most k colors. We prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c95bbc3ee6770a0d360f325d104e110f
https://doi.org/10.1007/978-3-642-45030-3_65
https://doi.org/10.1007/978-3-642-45030-3_65