Bart de Keijzer

CoRR, 2024

2023

Financial networks with singleton liability priorities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Clearing Financial Networks with Derivatives: From Intractability to Algorithms.

[BibT_eX]

[DOI]

CoRR, 2023

Non-Obvious Manipulability in Extensive-Form Mechanisms: The Revelation Principle for Single-Parameter Agents.

[BibT_eX]

[DOI]

Thomas Archbold

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Non-Obvious Manipulability for Single-Parameter Agents and Bilateral Trade.

[BibT_eX]

[DOI]

Thomas Archbold

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Facility Reallocation on the Line.

[BibT_eX]

[DOI]

Dominik Wojtczak

Algorithmica, 2022

Reasoning and interaction for social artificial intelligence.

[BibT_eX]

[DOI]

Albert Meroño-Peñuela

AI Commun., 2022

Strong Approximations and Irrationality in Financial Networks with Derivatives.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Strong Approximations and Irrationality in Financial Networks with Financial Derivatives.

[BibT_eX]

[DOI]

Riccardo Colini-Baldeschi

CoRR, 2021

2020

Approximately Efficient Two-Sided Combinatorial Auctions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2020

Obviously Strategyproof Single-Minded Combinatorial Auctions.

[BibT_eX]

[DOI]

Maria Kyropoulou

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2019

The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

On Strong Equilibria and Improvement Dynamics in Network Creation Games.

[BibT_eX]

[DOI]

Riccardo Colini-Baldeschi

Tomasz Janus

Internet Math., 2019

Multi-Unit Bilateral Trade.

[BibT_eX]

[DOI]

Matthias Gerstgrasser

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2017

Sequential Posted-Price Mechanisms with Correlated Valuations.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

Coordination games on graphs.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2017

Fixed Price Approximability of the Optimal Gain from Trade.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

2016

Approximately Efficient Double Auctions with Strong Budget Balance.

[BibT_eX]

[DOI]

Riccardo Colini-Baldeschi

Irving van Heuven van Staereling

Stefano Leonardi

Stefano Turchetta

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The Ground-Set-Cost Budgeted Maximum Coverage Problem.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

The Strong Price of Anarchy of Linear Bottleneck Congestion Games.

[BibT_eX]

[DOI]

Orestis Telelis

Theory Comput. Syst., 2015

Inefficiency of Games with Social Context.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

The Curse of Sequentiality in Routing Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014

Altruism and Its Impact on the Price of Anarchy.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

Finding Optimal Solutions for Voting Game Design Problems.

[BibT_eX]

[DOI]

Tomas B. Klos

Yingqian Zhang

J. Artif. Intell. Res., 2014

Shapley meets Shapley.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

The H-index can be Easily Manipulated.

[BibT_eX]

[DOI]

Krzysztof R. Apt

Bull. EATCS, 2013

Inefficiency of Standard Multi-unit Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration

[BibT_eX]

[DOI]

Tomas B. Klos

Yingqian Zhang

CoRR, 2012

Finding Social Optima in Congestion Games with Positive Externalities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Housing Markets with Indifferences: A Tale of Two Mechanisms.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

The Robust Price of Anarchy of Altruistic Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Complexity of coalition structure generation.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games.

[BibT_eX]

[DOI]

Orestis Telelis

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Enumeration and exact design of weighted voting games.

[BibT_eX]

[DOI]

Tomas Klos

Yingqian Zhang

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009

On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008

Three New Complexity Results for Resource Allocation Problems

[BibT_eX]

[DOI]