Peter Bro Miltersen

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 5

Top Venues

CoRR

SAGT

WINE

Artif. Intell.

Publications

Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng
Walrasian pricing in multi-unit auctions. Artif. Intell. 322 (2023)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Troels Bjerre Lund, Peter Bro Miltersen
Computation of Stackelberg Equilibria of Finite Sequential Games. ACM Trans. Economics and Comput. 5 (4) (2017)
Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng
Walrasian Pricing in Multi-Unit Auctions. MFCS (2017)
James Aspnes, Yuval Ishai, Peter Bro Miltersen
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013). SIAM J. Comput. 45 (2) (2016)
Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng
Envy-Free Pricing in Multi-unit Markets. CoRR (2016)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Computation of Stackelberg Equilibria of Finite Sequential Games. WINE (2015)
Simina Brânzei, Hadi Hosseini, Peter Bro Miltersen
Characterization and Computation of Equilibria for Indivisible Goods. CoRR (2015)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Computation of Stackelberg Equilibria of Finite Sequential Games. CoRR (2015)
Simina Brânzei, Peter Bro Miltersen
A Dictatorship Theorem for Cake Cutting. IJCAI (2015)
Simina Brânzei, Hadi Hosseini, Peter Bro Miltersen
Characterization and Computation of Equilibria for Indivisible Goods. SAGT (2015)
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form. CoRR (2014)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory Comput. Syst. 55 (2) (2014)
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT (2014)
Aris Filos-Ratsikas, Peter Bro Miltersen
Truthful Approximations to Range Voting. WINE (2014)
Peter Bro Miltersen
Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk). STACS (2014)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) (2013)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. Electron. Colloquium Comput. Complex. 20 (2013)
Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. J. ACM 60 (1) (2013)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
A Faster Algorithm for Solving One-Clock Priced Timed Games. CONCUR (2013)
Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games. RP (2013)
Aris Filos-Ratsikas, Peter Bro Miltersen
Truthful approximations to range voting. CoRR (2013)
Simina Brânzei, Peter Bro Miltersen
Equilibrium analysis in cake cutting. AAMAS (2013)
Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. ISAAC (2013)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. IACR Cryptol. ePrint Arch. 2013 (2013)
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Deterministic Graphical Games Revisited. J. Log. Comput. 22 (2) (2012)
Rasmus Ibsen-Jensen, Peter Bro Miltersen
Solving Simple Stochastic Games with Few Coin Toss Positions. ESA (2012)
Ivan Bjerre Damgård, Jonas Kölker, Peter Bro Miltersen
Secret Sharing and Secure Computing from Monotone Formulae. IACR Cryptol. ePrint Arch. 2012 (2012)
Simina Brânzei, Clara Forero, Kate Larson, Peter Bro Miltersen
Equilibria of Chinese Auctions CoRR (2012)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
A Faster Algorithm for Solving One-Clock Priced Timed Games CoRR (2012)
Peter Bro Miltersen, Or Sheffet
Send mixed signals: earn more, work less. EC (2012)
Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
Exact Algorithms for Solving Stochastic Games CoRR (2012)
Peter Bro Miltersen, Or Sheffet
Send Mixed Signals -- Earn More, Work Less CoRR (2012)
Peter Bro Miltersen
Recent Results on Howard's Algorithm. MEMICS (2012)
Rasmus Ibsen-Jensen, Peter Bro Miltersen
Solving simple stochastic games with few coin toss positions CoRR (2011)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. CSR (2011)
Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
Exact algorithms for solving stochastic games: extended abstract. STOC (2011)
Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. ICS (2011)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The complexity of solving reachability games using value and strategy iteration CoRR (2010)
Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani
10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation (2010)
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos
Privacy-enhancing auctions using rational cryptography. BQGT (2010)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. SAGT (2010)
Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor CoRR (2010)
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen
Hilbert's Thirteenth Problem and Circuit Complexity. ISAAC (2009)
Daniel Andersson, Peter Bro Miltersen
The Complexity of Solving Stochastic Games on Graphs. ISAAC (2009)
Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS (2009)
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos
Privacy-Enhancing Auctions Using Rational Cryptography. CRYPTO (2009)
Guillaume Escamocher, Peter Bro Miltersen, Rocio Santillan R.
Existence and computation of equilibria of first-price auctions with integral valuations and bids. AAMAS (2) (2009)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis. SIAM J. Comput. 38 (5) (2009)
Vladimir Gurvich, Peter Bro Miltersen
On the computational complexity of solving stochastic mean-payoff games CoRR (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen
Trembling hand perfection is NP-hard CoRR (2008)
Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
On Range of Skill. AAAI (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen, Troels Bjerre Sørensen
Fast algorithms for finding proper strategies in game trees. SODA (2008)
Peter Bro Miltersen
Special Issue: "Conference on Computational Complexity 2007" Guest Editor's Foreword. Comput. Complex. 17 (2) (2008)
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Approximability and parameterized complexity of minmax values CoRR (2008)
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Deterministic Graphical Games Revisited. CiE (2008)
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos
Privacy-Enhancing First-Price Auctions Using Rational Cryptography. IACR Cryptol. ePrint Arch. 2008 (2008)
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Approximability and Parameterized Complexity of Minmax Values. WINE (2008)
Peter Bro Miltersen, Troels Bjerre Sørensen
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament. AAMAS (2007)
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Simple Recursive Games CoRR (2007)
P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel
07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation (2007)
Anna Gál, Peter Bro Miltersen
The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379 (3) (2007)
Peter Bro Miltersen
The Computational Complexity of One-Dimensional Sandpiles. Theory Comput. Syst. 41 (1) (2007)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Finding Equilibria in Games of No Chance. COCOON (2007)
Peter Bro Miltersen, Troels Bjerre Sørensen
Computing Proper Equilibria of Zero-Sum Games. Computers and Games (2006)
Anna Gál, Peter Bro Miltersen
The Cell Probe Complexity of Succinct Data Structures. Complexity of Boolean Functions (2006)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis. Complexity of Boolean Functions (2006)
Jesper Torp Kristensen, Peter Bro Miltersen
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. COCOON (2006)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis. Computational Complexity Conference (2006)
Peter Bro Miltersen, Troels Bjerre Sørensen
Computing sequential equilibria for two-player games. SODA (2006)
Jesper Torp Kristensen, Peter Bro Miltersen
Finding small OBDDs for incompletely specified truth tables is hard Electron. Colloquium Comput. Complex. (004) (2006)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Circuits on cylinders. Comput. Complex. 15 (1) (2006)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
Reviewing bounds on the circuit size of the hardest functions. Inf. Process. Lett. 95 (2) (2005)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On converting CNF to DNF. Theor. Comput. Sci. 347 (1-2) (2005)
Peter Bro Miltersen
Lower bounds on the size of selection and rank indexes. SODA (2005)
Peter Bro Miltersen
The Computational Complexity of One-Dimensional Sandpiles. CiE (2005)
Peter Bro Miltersen, N. V. Vinodchandran
Derandomizing Arthur-Merlin Games using Hitting Sets. Comput. Complex. 14 (3) (2005)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
Reviewing Bounds on the Circuit Size of the Hardest Functions Electron. Colloquium Comput. Complex. (032) (2005)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis Electron. Colloquium Comput. Complex. (037) (2005)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
Some Meet-in-the-Middle Circuit Lower Bounds. MFCS (2004)
Anna Gál, Peter Bro Miltersen
The Cell Probe Complexity of Succinct Data Structures. ICALP (2003)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Circuits on Cylinders. FCT (2003)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On Converting CNF to DNF. MFCS (2003)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On Converting CNF to DNF Electron. Colloquium Comput. Complex. 10 (017) (2003)
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
Are Bitvectors Optimal? SIAM J. Comput. 31 (6) (2002)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Circuits on Cylinders Electron. Colloquium Comput. Complex. (066) (2002)
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
Lower Bounds for Dynamic Algebraic Problems. Inf. Comput. 171 (2) (2001)
Mary Cryan, Peter Bro Miltersen
On Pseudorandom Generators in NC. MFCS (2001)
Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh
Deterministic Dictionaries. J. Algorithms 41 (1) (2001)
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
Are bitvectors optimal? STOC (2000)
Peter Bro Miltersen
On the Shannon Function for Partially Defined Boolean Functions. ICALP Satellite Workshops (2000)
Harry Buhrman, Sophie Laplante, Peter Bro Miltersen
New Bounds for the Language Compression Problem. Computational Complexity Conference (2000)
Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
Instructions Only. Theor. Comput. Sci. 215 (1-2) (1999)
Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON (1999)
Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
Linear Hash Functions. J. ACM 46 (5) (1999)
David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
On Monotone Planar Circuits. Computational Complexity Conference (1999)
Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup
The Complexity of Identifying Large Equivalence Classes. Fundam. Informaticae 38 (1-2) (1999)
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
Lower Bounds for Dynamic Algebraic Problems. STACS (1999)
Peter Bro Miltersen, N. V. Vinodchandran
Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS (1999)

Peter Bro Miltersen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Bro Miltersen