Dan, C.
, Hansen, K. A., Jiang, H., Wang, L. & Zhou, Y. (2018).
Low rank approximation of binary matrices: Column subset selection and generalizations. I I. Potapov, J. Worrell & P. Spirakis (red.),
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (Bind 117, s. 41:1-41:16). Artikel 41 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.MFCS.2018.41
Bosanský, B., Brânzei, S.
, Hansen, K. A., Lund, T. B.
& Miltersen, P. B. (2017).
Computation of Stackelberg Equilibria of Finite Sequential Games.
A C M Transactions on Economics and Computation,
5(4), 23:1-23:24. Artikel 23.
https://doi.org/10.1145/3133242
Brânzei, S.
, Filos-Ratsikas, A., Miltersen, P. B. & Zeng, Y. (2017).
Walrasian pricing in multi-unit auctions. I K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (red.),
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 (Bind 83, s. 80:1-80:14). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.MFCS.2017.80
Caragiannis, I., Filos-Ratsikas, A.
, Frederiksen, S. K. S., Hansen, K. A. & Tan, Z. (2016).
Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship. I
Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings (Bind 10123, s. 236-250). Springer VS.
https://doi.org/10.1007/978-3-662-54110-4_17
Branzei, S., Hosseini, H.
& Miltersen, P. B. (2015).
Characterization and Computation of Equilibria for Indivisible Goods. I
Algorithmic Game Theory: 8th International Symposium, SAGT 2015, Saarbrücken, Germany, September 28–30, 2015, Proceedings (s. 244-255). Springer VS.
https://doi.org/10.1007/978-3-662-48433-3_19
Bosansky, B., Branzei, S., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2015).
Computation of Stackelberg Equilibria of Finite Sequential Games. I E. Markakis & G. Schäfer (red.),
Web and Internet Economics: 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings (Bind 9470, s. 201-215). Springer VS.
http://arxiv.org/abs/1507.07677
Hansen, K. A., Komarath, B., Sarma M. N., J.
, Talebanfard, N. & Skyum, S. (2014).
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. I E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (red.),
Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (s. 336-347 ). Springer VS.
https://doi.org/10.1007/978-3-662-44465-8_29
Michalak, T. P., Szczepański , P. L., Rahwan, T., Chrobak, A.
, Branzei, S., Wooldridge, M. & Jennings , N. (2014).
Implementation and Computation of a Value for Generalized Characteristic Function Games.
A C M Transactions on Economics and Computation,
2(4), Artikel 16.
https://doi.org/10.1145/2665007
Etessami, K.
, Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2014).
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. I R. Lavi (red.),
Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (s. 231-243 ). Springer VS.
https://doi.org/10.1007/978-3-662-44803-8_20
Branzei, S., Chen, Y., Deng, X.
, Filos-Ratsikas, A., Frederiksen, S. K. S. & Zhang, J. (2014).
The Fisher Market Game: Equilibrium and Welfare. I
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (s. 587-593). AAAI Press.
http://www.aaai.org/Library/AAAI/aaai14contents.php
Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2013).
A Faster Algorithm for Solving One-Clock Priced Timed Games. I P. R. D*Argenio & H. Melgratti (red.),
CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings (s. 531-545). Springer VS.
https://doi.org/10.1007/978-3-642-40184-8_37
Frederiksen, S. K. S. & Miltersen, P. B. (2013).
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. I L. Cai, S.-W. Cheng & T.-W. Lam (red.),
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (s. 457-467 ). Springer VS.
https://doi.org/10.1007/978-3-642-45030-3_43
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013).
Efficient multiparty protocols via log-depth threshold formulae. I R. Canetti & J. A. Garay (red.),
Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (s. 185-202). Springer VS.
https://doi.org/10.1007/978-3-642-40084-1_11
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. (2013).
Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed.
Electronic Colloquium on Computational Complexity, (TR13-107).
http://eccc.hpi-web.de/report/2013/107/
Branzei, S., Michalak, T., Rahwan, T., Larson, K. & Jennings, N. (2013).
Matchings with Externalities and Attitudes. I M. Gina & O. Shehory (red.),
International Conference on Autonomous Agents and Multi-agent Systems, AAMAS '13 (s. 295-302 ). Association for Computing Machinery.
http://dl.acm.org/citation.cfm?id=2484969&CFID=340403434&CFTOKEN=84711969
Gal, A.
, Hansen, K. A., Koucky, M., Pudlak, P. & Viola, E. (2013).
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
I E E E Transactions on Information Theory,
59(10), 6611-6627.
https://doi.org/10.1109/TIT.2013.2270275