A New Lower Bound for Deterministic Truthful Scheduling
|
2020 |
Giannakopoulos, Yiannis |
Line-Up Elections: Parallel Voting with Shared Candidate Pool
|
2020 |
Boehmer, Niclas |
A General Framework for Computing the Nucleolus via Dynamic Programming
|
2020 |
Könemann, Jochen |
On the Integration of Shapley-Scar Housing Markets
|
2020 |
Kumar, Rajnish |
Congestion Games with Priority-Based Scheduling
|
2020 |
Bilò, Vittorio |
Dynamic Equilibria in Time-Varying Networks
|
2020 |
Pham, Hoang Minh |
Two-Buyer Sequential Multiunit Auctions with No Overbidding
|
2020 |
Ahunbay, Mete Seref |
The Impact of Spillback on the Price of Anarchy for Flows over Time
|
2020 |
Israel, Jonas |
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms
|
2020 |
Krishnaa, Prem |
Approximating Stable Matchings with Ties of Bounded Size
|
2020 |
Koenemann, Jochen |
Targeted Intervention in Random Graphs
|
2020 |
Brown, William |
Race Scheduling Games
|
2020 |
Rosner, Shaul |
Finding Fair and Efficient Allocations When Valuations Don't Add Up
|
2020 |
Benabbou, Nawal |
Asymptotically Optimal Communication in Simple Mechanisms
|
2020 |
Anagnostides, loannis |
A Unifying Approximate Potential for Weighted Congestion Games
|
2020 |
Giannakopoulos, Yiannis |
Price of Anarchy in Congestion Games with Altruistic/Spiteful Players
|
2020 |
Schröder, Marc |
Bribery and Control in Stable Marriage
|
2020 |
Boehmer, Niclas |
Modified Schelling Games
|
2020 |
Kanellopoulos, Panagiotis |
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
|
2020 |
Giannakopoulos, Yiannis |
Mechanism Design for Perturbation Stable Combinatorial Auctions
|
2020 |
Fikioris, Giannis |