×

Found 8 Documents (Results 1–8)

Submodular secretary problems: cardinality, matching, and linear constraints. (English) Zbl 1467.68225

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 16, 22 p. (2017).
MSC:  68W27 68W20 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Smoothness for simultaneous composition of mechanisms with admission. (English) Zbl 1404.91025

Cai, Yang (ed.) et al., Web and internet economics. 12th international conference, WINE 2016, Montreal, Canada, December 11–14, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-54109-8/pbk; 978-3-662-54110-4/ebook). Lecture Notes in Computer Science 10123, 294-308 (2016).
MSC:  91A20 91A26 91B15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software