E-LIB Suche - Ergebnisse für: Miltersen, Peter Bro

1

Walrasian pricing in multi-unit auctions:

Brânzei, Simina ; Filos-Ratsikas, Aris ; Miltersen, Peter Bro.
Artificial Intelligence. 322 (2023) - p. 103961 , 2023

2

Computation of Stackelberg Equilibria of Finite Sequential ..:

Bošanský, Branislav ; Brânzei, Simina ; Hansen, Kristoffer Arnsfelt..
ACM Transactions on Economics and Computation (TEAC). 5 (2017) 4 - p. 1-24 , 2017

Link: https://dl.acm.org/doi/1..

3

Computation of Stackelberg Equilibria of Finite Sequential ..:

Bošanský, Branislav ; Brânzei, Simina ; Hansen, Kristoffer Arnsfelt..
ACM Transactions on Economics and Computation. 5 (2017) 4 - p. 1-24 , 2017

Link: https://doi.org/10.1145/..

4

Special Section on the Forty-Fifth Annual ACM Symposium on ..:

Aspnes, James ; Ishai, Yuval ; Miltersen, Peter Bro
SIAM Journal on Computing. 45 (2016) 2 - p. 459-460 , 2016

Link: https://doi.org/10.1137/..

5

Strategy Iteration Is Strongly Polynomial for 2-Player Turn..:

Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Zwick, Uri
Journal of the ACM (JACM). 60 (2013) 1 - p. 1-16 , 2013

Link: https://dl.acm.org/doi/1..

6

Strategy Iteration Is Strongly Polynomial for 2-Player Turn..:

Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Zwick, Uri
Journal of the ACM. 60 (2013) 1 - p. 1-16 , 2013

Link: https://doi.org/10.1145/..

7

Equilibrium analysis in cake cutting:

, In: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems,

Brânzei, Simina ; Miltersen, Peter Bro - p. 327-334 , 2013

Link: https://dl.acm.org/doi/1..

8

The Complexity of Solving Reachability Games Using Value an..:

Hansen, Kristoffer Arnsfelt ; Ibsen-Jensen, Rasmus ; Miltersen, Peter Bro
Theory of Computing Systems. 55 (2013) 2 - p. 380-403 , 2013

Link: https://doi.org/10.1007/..

9

Exact algorithms for solving stochastic games : extended..:

, In: Proceedings of the forty-third annual ACM symposium on Theory of computing,

Hansen, Kristoffer Arnsfelt ; Koucky, Michal ; Lauritzen, Niels.. - p. 205-214 , 2011

Link: https://dl.acm.org/doi/1..

10

Computing a Quasi-Perfect Equilibrium of a Two-Player Game:

Miltersen, Peter Bro ; Sørensen, Troels Bjerre
Economic Theory. 42 (2010) 1 - p. 175-192 , 2010

Link: https://www.jstor.org/st..

11

The computational complexity of trembling hand perfection a..:

, In: Proceedings of the Third international conference on Algorithmic game theory,

Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre - p. 198-209 , 2010

Link: https://dl.acm.org/doi/1..

12

Privacy-enhancing auctions using rational cryptography:

, In: Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions,

Miltersen, Peter Bro ; Nielsen, Jesper Buus ; Triandopoulos, Nikos - p. 1 ff. , 2010

Link: https://dl.acm.org/doi/1..

13

The Computational Complexity of Trembling Hand Perfection a..:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,

Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre - p. 198-209 , 2010

Link: https://doi.org/10.1007/..

14

Computing a quasi-perfect equilibrium of a two-player game:

Miltersen, Peter Bro ; Sørensen, Troels Bjerre
Economic Theory. 42 (2009) 1 - p. 175-192 , 2009

Link: https://doi.org/10.1007/..

15

On the Complexity of Numerical Analysis:

Allender, Eric ; Bürgisser, Peter ; Kjeldgaard-Pedersen, Johan.
SIAM Journal on Computing. 38 (2009) 5 - p. 1987-2006 , 2009

Link: https://doi.org/10.1137/..