default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBart de Keijzer
Person information
- affiliation: King's College London, UK
- affiliation (former): CWI, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Thomas Archbold, Bart de Keijzer, Carmine Ventre:
Willy Wonka Mechanisms. AAMAS 2024: 78-86- [c27]Jinyun Tong, Bart de Keijzer, Carmine Ventre:
Reducing Systemic Risk in Financial Networks through Donations. AAMAS 2024: 2519-2521 - [c26]Bart de Keijzer
, Carmine Ventre:
Selfishly Cancelling Debts Can Reduce Systemic Risk. ECAI 2024: 3397-3404 - [c25]Bart de Keijzer, Carmine Ventre:
Reducing Systemic Risk in Financial Networks through Donations. ECAI 2024: 3405-3412 - [i17]Thomas Archbold, Bart de Keijzer, Carmine Ventre:
Willy Wonka Mechanisms. CoRR abs/2402.08314 (2024) - 2023
- [j14]Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Financial networks with singleton liability priorities. Theor. Comput. Sci. 963: 113965 (2023) - [c24]Thomas Archbold, Bart de Keijzer, Carmine Ventre:
Non-Obvious Manipulability for Single-Parameter Agents and Bilateral Trade. AAMAS 2023: 2107-2115 - [c23]Thomas Archbold, Bart de Keijzer, Carmine Ventre:
Non-Obvious Manipulability in Extensive-Form Mechanisms: The Revelation Principle for Single-Parameter Agents. IJCAI 2023: 2503-2510 - [i16]Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Clearing Financial Networks with Derivatives: From Intractability to Algorithms. CoRR abs/2312.05139 (2023) - 2022
- [j13]Elizabeth Black, Martim Brandão, Oana Cocarascu, Bart de Keijzer, Yali Du, Derek Long, Michael Luck, Peter McBurney, Albert Meroño-Peñuela, Simon Miles, Sanjay Modgil, Luc Moreau, Maria Polukarov, Odinaldo Rodrigues, Carmine Ventre:
Reasoning and interaction for social artificial intelligence. AI Commun. 35(4): 309-325 (2022) - [j12]Bart de Keijzer, Dominik Wojtczak:
Facility Reallocation on the Line. Algorithmica 84(10): 2898-2925 (2022) - [c22]Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Strong Approximations and Irrationality in Financial Networks with Derivatives. ICALP 2022: 76:1-76:18 - [c21]Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Financial Networks with Singleton Liability Priorities. SAGT 2022: 205-222 - [i15]Thomas Archbold, Bart de Keijzer, Carmine Ventre:
Non-Obvious Manipulability for Single-Parameter Agents and Bilateral Trade. CoRR abs/2202.06660 (2022) - 2021
- [i14]Bart de Keijzer, Dominik Wojtczak:
Facility Reallocation on the Line. CoRR abs/2103.12894 (2021) - [i13]Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Strong Approximations and Irrationality in Financial Networks with Financial Derivatives. CoRR abs/2109.06608 (2021) - 2020
- [j11]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. ACM Trans. Economics and Comput. 8(1): 4:1-4:29 (2020) - [c20]Bart de Keijzer, Maria Kyropoulou, Carmine Ventre:
Obviously Strategyproof Single-Minded Combinatorial Auctions. ICALP 2020: 71:1-71:17
2010 – 2019
- 2019
- [j10]Bart de Keijzer, Tomasz Janus:
On Strong Equilibria and Improvement Dynamics in Network Creation Games. Internet Math. 2019 (2019) - [j9]José Correa, Jasper de Jong, Bart de Keijzer, Marc Uetz:
The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing. Math. Oper. Res. 44(4): 1286-1303 (2019) - [j8]John Fearnley, Sanjay Jain, Bart de Keijzer, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. Int. J. Softw. Tools Technol. Transf. 21(3): 325-349 (2019) - [c19]Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik:
Multi-Unit Bilateral Trade. AAAI 2019: 1973-1980 - 2018
- [c18]Bart de Keijzer, Dominik Wojtczak:
Facility Reallocation on the Line. IJCAI 2018: 188-194 - [i12]Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik:
Multi-unit Bilateral Trade. CoRR abs/1811.05130 (2018) - 2017
- [j7]Krzysztof R. Apt, Bart de Keijzer, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination games on graphs. Int. J. Game Theory 46(3): 851-877 (2017) - [j6]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted-Price Mechanisms with Correlated Valuations. ACM Trans. Economics and Comput. 5(4): 22:1-22:39 (2017) - [c17]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. EC 2017: 591-608 - [c16]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta:
Fixed Price Approximability of the Optimal Gain from Trade. WINE 2017: 146-160 - [c15]Tomasz Janus, Bart de Keijzer:
On Strong Equilibria and Improvement Dynamics in Network Creation Games. WINE 2017: 161-176 - [i11]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta:
Fixed Price Approximability of the Optimal Gain From Trade. CoRR abs/1710.08394 (2017) - [i10]Tomasz Janus, Bart de Keijzer:
On Strong Equilibria and Improvement Dynamics in Network Creation Games. CoRR abs/1711.03466 (2017) - 2016
- [c14]Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer:
The Ground-Set-Cost Budgeted Maximum Coverage Problem. MFCS 2016: 50:1-50:13 - [c13]Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta:
Approximately Efficient Double Auctions with Strong Budget Balance. SODA 2016: 1424-1443 - [i9]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. CoRR abs/1611.05342 (2016) - 2015
- [j5]Bart de Keijzer, Guido Schäfer, Orestis Telelis:
The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory Comput. Syst. 57(2): 377-396 (2015) - [j4]Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer:
Inefficiency of Games with Social Context. Theory Comput. Syst. 57(3): 782-804 (2015) - [c12]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted Price Mechanisms with Correlated Valuations. WINE 2015: 1-15 - [c11]José Correa, Jasper de Jong, Bart de Keijzer, Marc Uetz:
The Curse of Sequentiality in Routing Games. WINE 2015: 258-271 - [i8]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted Price Mechanisms with Correlated Valuations. CoRR abs/1503.02200 (2015) - 2014
- [j3]Bart de Keijzer, Tomas B. Klos, Yingqian Zhang:
Finding Optimal Solutions for Voting Game Design Problems. J. Artif. Intell. Res. 50: 105-140 (2014) - [j2]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
Altruism and Its Impact on the Price of Anarchy. ACM Trans. Economics and Comput. 2(4): 17:1-17:45 (2014) - [c10]Haris Aziz, Bart de Keijzer:
Shapley meets Shapley. STACS 2014: 99-111 - 2013
- [j1]Bart de Keijzer, Krzysztof R. Apt:
The H-index can be Easily Manipulated. Bull. EATCS 110: 79-85 (2013) - [c9]Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
Inefficiency of Standard Multi-unit Auctions. ESA 2013: 385-396 - [c8]Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer:
Inefficiency of Games with Social Context. SAGT 2013: 219-230 - [i7]Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
On the Inefficiency of Standard Multi-Unit Auctions. CoRR abs/1303.1646 (2013) - [i6]Bart de Keijzer, Krzysztof R. Apt:
The H-index can be easily manipulated. CoRR abs/1304.2557 (2013) - [i5]Haris Aziz, Bart de Keijzer:
Shapley Meets Shapley. CoRR abs/1307.0332 (2013) - 2012
- [c7]Haris Aziz, Bart de Keijzer:
Housing Markets with Indifferences: A Tale of Two Mechanisms. AAAI 2012: 1249-1255 - [c6]Bart de Keijzer, Guido Schäfer:
Finding Social Optima in Congestion Games with Positive Externalities. ESA 2012: 395-406 - [i4]Bart de Keijzer, Tomas B. Klos, Yingqian Zhang:
Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration. CoRR abs/1204.5213 (2012) - 2011
- [c5]Haris Aziz, Bart de Keijzer:
Complexity of coalition structure generation. AAMAS 2011: 191-198 - [c4]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
The Robust Price of Anarchy of Altruistic Games. WINE 2011: 383-390 - [i3]Haris Aziz, Bart de Keijzer:
Complexity of coalition structure generation. CoRR abs/1101.1007 (2011) - [i2]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
The Robust Price of Anarchy of Altruistic Games. CoRR abs/1112.3680 (2011) - 2010
- [c3]Bart de Keijzer, Tomas Klos, Yingqian Zhang:
Enumeration and exact design of weighted voting games. AAMAS 2010: 391-398 - [c2]Bart de Keijzer, Guido Schäfer, Orestis Telelis:
On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. SAGT 2010: 335-346
2000 – 2009
- 2009
- [c1]Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yingqian Zhang:
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences. ADT 2009: 98-110 - 2008
- [i1]Bart de Keijzer:
Three New Complexity Results for Resource Allocation Problems. CoRR abs/0810.0532 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
