215 citations · 792 across the 83 of their papers we have counts for
12 papers · 1 filter
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger +1
The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two clas…
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
Solving parity games, which are equivalent to modal -calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the…
Faster Algorithms for Mean-Payoff Parity Games
Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil
Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players.…
Ad Exchange: Envy-Free Auctions with Mediators
Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer
Ad exchanges are an emerging platform for trading advertisement slots on the web with billions of dollars revenue per year. Every time a user visits a web page, the publisher of th…
Combinatorial Auctions with Conflict-Based Externalities
Yun Kuen Cheung, Monika Henzinger, Martin Hoefer +1
Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism design. However, contrary to the standard model, empirical studies suggest that a bidder's valuation of…
Valuation Compressions in VCG-Based Combinatorial Auctions
Paul Duetting, Monika Henzinger, Martin Starnberger
The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maxi…