The following pages link to Matthias Feldotto (Q1631667):
Displaying 9 items.
- Congestion games with mixed objectives (Q1631669) (← links)
- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria (Q2936974) (← links)
- Congestion Games with Mixed Objectives (Q2958352) (← links)
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games (Q3449591) (← links)
- Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games (Q4614069) (← links)
- Fully-Dynamic Bin Packing with Little Repacking (Q5002726) (← links)
- Congestion Games with Complementarities (Q5283369) (← links)
- Pure Nash equilibria in restricted budget games (Q5920148) (← links)
- Pure Nash equilibria in restricted budget games (Q5971178) (← links)
