Abstract is missing.
- Stable Matchings with Ties, Master Preference Lists, and Matroid ConstraintsNaoyuki Kamiyama. 3-14 [doi]
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and ApproximabilityÁgnes Cseh, David F. Manlove. 15-26 [doi]
- Pareto Optimal Matchings in Many-to-Many Markets with TiesKatarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari. 27-39 [doi]
- Cost-Sharing Models in Participatory SensingGeorgios Birmpas, Costas Courcoubetis, Ioannis Giotis 0001, Evangelos Markakis. 43-56 [doi]
- Further Results on Capacitated Network Design GamesThomas Erlebach, Matthew Radoja. 57-68 [doi]
- Cost-Sharing Scheduling Games on Restricted Unrelated MachinesGuy Avni, Tami Tamir. 69-81 [doi]
- Efficient Money Burning in General DomainsDimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis. 85-97 [doi]
- Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism DesignKhaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani. 98-109 [doi]
- Equilibria of Plurality Voting: Lazy and Truth-Biased VotersEdith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron. 110-122 [doi]
- The Combinatorial World (of Auctions) According to GARPShant Boodaghians, Adrian Vetta. 125-136 [doi]
- Auction Design with a Revenue TargetPaul W. Goldberg, Bo Tang. 137-149 [doi]
- Algorithmic Signaling of Features in Auction DesignShaddin Dughmi, Nicole Immorlica, Ryan O'Donnell, Li-Yang Tan. 150-162 [doi]
- On the Efficiency of the Proportional Allocation Mechanism for Divisible ResourcesGeorge Christodoulou 0001, Alkmini Sgouritsa, Bo Tang. 165-177 [doi]
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation GamesMaximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik. 178-189 [doi]
- Can Bandwidth Sharing Be Truthful?Yukun Cheng, Xiaotie Deng, Yifan Pi, Xiang Yan. 190-202 [doi]
- The Web Graph as an EquilibriumGeorgios Kouroupas, Evangelos Markakis, Christos H. Papadimitriou, Vasileios Rigas, Martha Sideri. 203-215 [doi]
- Excluding Braess's Paradox in Nonatomic Selfish RoutingXujin Chen, Zhuo Diao, Xiao-Dong Hu. 219-230 [doi]
- "Beat-Your-Rival" Routing GamesGideon Blocq, Ariel Orda. 231-243 [doi]
- Characterization and Computation of Equilibria for Indivisible GoodsSimina Brânzei, Hadi Hosseini, Peter Bro Miltersen. 244-255 [doi]
- When Can Limited Randomness Be Used in Repeated Games?Pavel Hubácek, Moni Naor, Jonathan Ullman. 259-271 [doi]
- Settling Some Open Problems on 2-Player Symmetric Nash EquilibriaRuta Mehta, Vijay V. Vazirani, Sadra Yazdanbod. 272-284 [doi]
- Approximating Nash Equilibria in Tree Polymatrix GamesSiddharth Barman, Katrina Ligett, Georgios Piliouras. 285-296 [doi]
- Commitment in First-Price AuctionsYunjian Xu, Katrina Ligett. 299 [doi]
- Brief Announcement: Effect of Strategic Grading and Early Offers in Matching MarketsHedyeh Beyhaghi, Nishanth Dikkala, Éva Tardos. 300-302 [doi]
- Brief Announcement: New Mechanisms for Pairwise Kidney ExchangeHossein Efsandiari, Guy Kortsarz. 303-304 [doi]
- Brief Announcement: On Effective Affirmative Action in School ChoiceYun Liu. 305-306 [doi]
- Brief Announcement: Resource Allocation Games with Multiple Resource ClassesRoy B. Ofer, Tami Tamir. 307-308 [doi]
- Brief Announcement: On the Fair Subset Sum ProblemGaia Nicosia, Andrea Pacifici, Ulrich Pferschy. 309-311 [doi]
- Brief Announcement: Computation of Fisher-Gale Equilibrium by AuctionYurii Nesterov, Vladimir Shikhman. 312-313 [doi]