From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. | 0 | 0.34 | 2019 |
Pure Nash Equilibria in Restricted Budget Games. | 0 | 0.34 | 2019 |
Disaggregating User Evaluations Using the Shapley Value. | 0 | 0.34 | 2018 |
Fully-Dynamic Bin Packing with Little Repacking. | 0 | 0.34 | 2018 |
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. | 4 | 0.41 | 2017 |
A Tight Approximation for Fully Dynamic Bin Packing without Bundling. | 1 | 0.36 | 2017 |
Congestion Games with Complementarities. | 0 | 0.34 | 2017 |
Towards a Lean Approach to Gamifying Education. | 0 | 0.34 | 2017 |
Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. | 2 | 0.42 | 2016 |
Congestion Games with Mixed Objectives. | 1 | 0.44 | 2016 |
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games | 2 | 0.42 | 2015 |
A simulation framework for analyzing complex infinitely repeated games | 0 | 0.34 | 2014 |
HSkip+: A self-stabilizing overlay network for nodes with heterogeneous bandwidths | 1 | 0.34 | 2014 |
Bounding The Potential Function In Congestion Games And Approximate Pure Nash Equilibria | 3 | 0.41 | 2014 |
Schema-based Parallel Compression and Decompression of XML Data. | 0 | 0.34 | 2013 |