"Computer science"

Learning Multi-Item Auctions with (or without) Samples
We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide …
PDF DOI arXiv
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words ($\omega$-automata) have wide applications in formal language theory as well as in modeling and verifying …
PDF DOI