For conference participants, the papers can be accessed online here. The link will be active until 24.10.2015.

Regular Papers

Naoyuki Kamiyama.
Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
Yukun Cheng, Xiaotie Deng, Yifan Pi and Xiang Yan.
Can Bandwidth Sharing Be Truthful?
George Christodoulou, Alkmini Sgouritsa and Bo Tang.
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
Ruta Mehta, Vijay Vazirani and Sadra Yazdanbod.
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
Fahimeh Ramezani, Khaled Elbassioni and Kurt Mehlhorn.
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design
Xujin Chen, Zhuo Diao and Xiaodong Hu.
Excluding Braess's Paradox in Nonatomic Selfish Routing
Maximilian Drees, Matthias Feldotto, Sören Riechers and Alexander Skopalik.
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
Bo Tang and Paul Goldberg.
Auction Design with a Revenue Target
Edith Elkind, Evangelos Markakis, Svetlana Obraztsova and Piotr Skowron.
Equilibria of Plurality Voting: Lazy and Truth-biased Voters
Gideon Blocq and Ariel Orda.
``Beat-Your-Rival'' Routing Games
Shaddin Dughmi, Nicole Immorlica, Ryan O'Donnell and Li-Yang Tan.
Algorithmic Signaling of Features in Auction Design
Ágnes Cseh and David F. Manlove.
Stable marriage and roommates problems with restricted edges: complexity and approximability
Thomas Erlebach and Matthew Radoja.
Further Results on Capacitated Network Design Games
Pavel Hubacek, Moni Naor and Jonathan Ullman.
When Can Limited Randomness Be Used in Repeated Games?
Shant Boodaghians and Adrian Vetta.
The Combinatorial World (of Auctions) According to GARP
Yunjian Xu and Katrina Ligett.
Commitment in First-price Auctions
Baharak Rastegari, Katarina Cechlarova, Pavlos Eirinakis, Tamas Fleiner, Dimitrios Magos, David Manlove, Ioannis Mourtos and Eva Ocelakova.
Pareto Optimal Matchings in Many-to-Many Markets with Ties
Siddharth Barman, Katrina Ligett and Georgios Piliouras.
Approximating Nash Equilibria in Tree Polymatrix Games
Georgios Kouroupas, Evangelos Markakis, Christos Papadimitriou, Vasileios Rigas and Martha Sideri.
The Web Graph as an Equilibrium
Guy Avni and Tami Tamir.
Cost-Sharing Scheduling Games on Restricted Unrelated Machines
Simina Brânzei, Hadi Hosseini and Peter Bro Miltersen.
Characterization and Computation of Equilibria for Indivisible Goods
Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos and Emmanouil Zampetakis.
Efficient Money Burning in General Domains
Georgios Birmpas, Costas Courcoubetis, Ioannis Giotis and Evangelos Markakis.
Cost-sharing Models in Participatory Sensing

Brief Announcements

Vladimir Shikhman and Yurii Nesterov.
Computation of Fisher-Gale equilibrium by auction
Roy Ofer and Tami Tamir.
Resource Allocation Games with Multiple Resource Classes
Gaia Nicosia, Andrea Pacifici and Ulrich Pferschy.
On the Fair Subset Sum Problem
Yun Liu.
On Effective Affirmative Action in School Choice
Hossein Esfandiari and Guy Kortsarz.
New Mechanisms for Pairwise Kidney Exchange
Hedyeh Beyhaghi, Eva Tardos and Nishanth Dikkala.
Effect of Strategic Grading and Early Offers in Matching Markets