Image courtesy of SAGT 2016 Accepted Papers
The conference proceedings are available here.
Efficiency of equilibria in uniform matroid congestion games
Strong and Weak Acyclicity in Iterative Voting
Essential μ-compatible subgames for obtaining a von Neumann-Morgenstern stable set in an assignment game
On the Price of Anarchy of Highly Congested Nonatomic Network Games
A Strongly-Budget-Balanced Double-Auction Mechanism
The parallel complexity of coloring games
Designing cost-sharing methods for Bayesian Games
Dynamic Resource Allocation Games
Repeated multimarket contact with observation errors
Complexity and Optimality of the Best Response Algorithm in Random Potential Games
Analyzing Power in Weighted Voting Games With Super-Increasing Weights
Lipschitz Continuity and Approximate Equilibria
Deciding Maxmin Reachability in Half-Blind Stochastic Games
History-Independent Distributed Multi-Agent Learning
Revenue Maximization for Market Intermediation with Correlated Priors
Truthfulness and Approximation with Value-Maximizing Bidders
The Stable Roommates problem with short lists
The Impact of Worst-Case Deviations in Non-Atomic Network Routing games
The Big Match in Small Space (BEST PAPER)
Bribeproof mechanisms for two-values domains
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
Stable Matching with Uncertain Linear Preferences
The Anarchy of Scheduling Without Money
On Selfish Creation of Robust Networks
Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets
The price of stability of simple symmetric fractional hedonic games
An almost ideal coordination mechanism for unrelated machine scheduling
