Filters








5 Hits in 5.8 sec

Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard

Linda Cai, Clay Thomas, S. Matthew Weinberg, Michael Wagner
2020 Innovations in Theoretical Computer Science  
The auxiliary parts of the mechanism run in poly-time, 1 and the offered prices can also be computed in poly-time.  ...  to even achieve an m 1/2−ε -approximation (for any ε > 0) [36, 7, 8, 10, 13, 20, 19, 21].  ...  URL: http://proceedings.mlr.press/v97/ harshaw19a.html. 30 In Automata, Languages, and Programming -39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, pages  ... 
doi:10.4230/lipics.itcs.2020.61 dblp:conf/innovations/CaiTW20 fatcat:xmkaziuibbhqhjkcn337chhnge

Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets [article]

Elliot Anshelevich, Koushik Kar, Shreyas Sekar
2016 arXiv   pre-print
Are there pricing mechanisms which achieve both good revenue and good welfare simultaneously?  ...  We study large markets with a single seller which can produce many types of goods, and many multi-minded buyers.  ...  In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, pages 488-499, 2012.  ... 
arXiv:1610.04071v1 fatcat:23pxpgpj2bgdpismcwblxtm4ae

Implementing a Category-Theoretic Framework for Typed Abstract Syntax [article]

Benedikt Ahrens, Ralph Matthes, Anders Mörtberg
2021 pre-print
The main result of our work is a general construction that, when fed with a signature for a simply-typed language, returns an implementation of that language together with suitable boilerplate code, in  ...  In the present work, we describe what was necessary to generalize that work to account for simply-typed languages.  ...  Schloss Dagstuhl - Leibniz-Zentrum für International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Informatik, 2:1–2:23. https://doi.org/10.4230/LIPIcs.TYPES.2015.2  ... 
doi:10.1145/3497775.3503678 arXiv:2112.06984v1 fatcat:wvq3o2ihmffpfgxhvl2ox3ctuq

Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing [article]

Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
2021 arXiv   pre-print
We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust.  ...  We design online algorithms with predictions for a network flow allocation problem and restricted assignment makespan minimization.  ...  Pitts, and Roger Wattenhofer, editors, Automata, Languages, and Programming -39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, volume 7391 of Lecture Notes  ... 
arXiv:2011.11743v2 fatcat:tvt4v37f55hu7n6qwpik4ebvhq

50 Algebra in Computational Complexity (Dagstuhl Seminar 14391) Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, and Christopher Umans 85 Privacy and Security in an Age of Surveillance (Dagstuhl Perspectives Workshop

Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden, Artur D'avila Garcez, Marco Gori, Pascal Hitzler, Luís Lamb, Bart Preneel, Phillip Rogaway, Mark Ryan, Peter (+5 others)
unpublished
Jozeph, "Universal Factor Graphs," in Proc. of the 39th Int'l Colloquium on URL http://dx.doi.org/10.1007/978-3-642-31594-7_29 URL http://arxiv.org/abs/1204.6484v1 License Automata, Languages, and Programming  ...  [9, 10, 13] .  ...  , "A Fast and Fault-tolerant Microkernel-based System for Exascale Computing", DFG priority program 1648).  ... 
fatcat:e5wnf6cuhvc3bceegijgut34zm