Journal: Theory Comput. Syst.

Volume 59, Issue 4

561 -- 562Martin Hoefer, Ron Lavi. Preface to Special Issue on Algorithmic Game Theory
563 -- 580Elliot Anshelevich, John Postl. Profit Sharing with Thresholds and Non-monotone Player Utilities
581 -- 599Ioannis Caragiannis, Alexandros A. Voudouris. Welfare Guarantees for Proportional Allocations
600 -- 618George Christodoulou 0001, Alkmini Sgouritsa, Bo Tang. On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
619 -- 640Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis. Efficient Money Burning in General Domains
641 -- 663Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani. Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design
664 -- 682Mukund Sundararajan, Inbal Talgam-Cohen. Prediction and Welfare in Ad Auctions
683 -- 699Linda Farczadi, Konstantinos Georgiou, Jochen Könemann. Stable Marriage with General Preferences
700 -- 721Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari. Pareto Optimal Matchings in Many-to-Many Markets with Ties
722 -- 746Pavel Hubácek, Moni Naor, Jonathan Ullman. When Can Limited Randomness Be Used in Repeated Games?
747 -- 780Xujin Chen, Zhuo Diao, Xiaodong Hu. Network Characterizations for Excluding Braess's Paradox

Volume 59, Issue 3

397 -- 415Carme Àlvarez, Maria J. Serna, Aleix Fernàndez. Network Formation for Asymmetric Players and Bilateral Contracting
416 -- 439Simon Straub, Thomas Thierauf, Fabian Wagner. Counting the Number of Perfect Matchings in K 5-Free Graphs
440 -- 475Elliot Anshelevich, John Postl, Tom Wexler. Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness
476 -- 499Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz. On the Advice Complexity of the k-server Problem Under Sparse Metrics
500 -- 516Víctor Lavín Puente. Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries
517 -- 531Luis Filipe Coelho Antunes, Harry Buhrman, Armando Matos, André Souto, Andreia Teixeira. Distinguishing Two Probability Ensembles with One Sample from each Ensemble
532 -- 559Beate Bollig. On the Minimization of (Complete) Ordered Binary Decision Diagrams

Volume 59, Issue 2

159 -- 160Andrei Bulatov, Stephan Kreutzer. Preface
161 -- 179Sergey V. Avgustinovich, Svetlana Puzynina. Weak Abelian Periodicity of Infinite Words
180 -- 208Amaldev Manuel, Anca Muscholl, Gabriele Puppis. Walking on Data Words
209 -- 230Volker Diekert, Armin Weiß. QuickHeapsort: Modifications and Improved Analysis
231 -- 261Manfred Droste, Vitaly Perevoshchikov. Multi-weighted Automata and MSO Logic
262 -- 322Klaus Jansen, Stefan Erich Julius Kraft. An Improved Approximation Scheme for Variable-Sized Bin Packing
323 -- 376Gergely Kovásznai, Andreas Fröhlich, Armin Biere. Complexity of Fixed-Size Bit-Vector Logics
377 -- 396Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein. Information Lower Bounds via Self-Reducibility

Volume 59, Issue 1

1 -- 23Josep Díaz, Ioannis Giotis 0001, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna. On the Stability of Generalized Second Price Auctions with Budgets
24 -- 51Henning Fernau, Markus L. Schmid, Yngve Villanger. On the Parameterised Complexity of String Morphism Problems
52 -- 75Arno Pauly. The Computational Complexity of Iterated Elimination of Dominated Strategies
76 -- 98Venkatesan Guruswami, Euiwoong Lee. Complexity of Approximating CSP with Balance / Hard Constraints
99 -- 111Sheela Devadas, Ronitt Rubinfeld. A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
112 -- 132Manoj Gupta, Yogish Sabharwal, Sandeep Sen. The Update Complexity of Selection and Related Problems
133 -- 158Michael Kowalczyk, Jin-yi Cai. Holant Problems for 3-Regular Graphs with Complex Edge Functions