Journal: Theory Comput. Syst.

Volume 63, Issue 7

1449 -- 1450Vittorio Bilò, Michele Flammini. Guest Editorial: Special Issue on Algorithmic Game Theory
1451 -- 1469Georgios Birmpas, Evangelos Markakis, Orestis Telelis, Artem Tsikiridis. Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction
1470 -- 1498Alon Eden, Michal Feldman, Adi Vardi. Online Random Sampling for Budgeted Settings
1499 -- 1530Elliot Anshelevich, Wennan Zhu. Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
1531 -- 1553Markos Epitropou, Dimitris Fotakis, Martin Hoefer, Stratis Skoulakis. Opinion Formation Games with Aggregation and Negative Influence
1554 -- 1571Kristoffer Arnsfelt Hansen. The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
1572 -- 0Michael Benedikt. Guest Editorial: Special Issue on Database Theory
1573 -- 1594Simone Bova, Hubie Chen. How Many Variables are Needed to Express an Existential Positive Query?
1595 -- 1619Andrew McGregor 0001, Hoa T. Vu. Better Streaming Algorithms for the Maximum Coverage Problem
1620 -- 1678Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Evaluating Datalog via Tree Automata and Cycluits
1679 -- 1754Dominik D. Freydenberger. A Logic for Document Spanners