Burkhardt, J., Caragiannis, I., Fehrs, K., Russo, M.
, Schwiegelshohn, C. & Shyam, S. (2024).
Low-Distortion Clustering with Ordinal and Limited Cardinal Information. I M. Wooldridge, J. Dy & S. Natarajan (red.),
Technical Tracks 14 (9 udg., s. 9555-9563). Association for the Advancement of Artificial Intelligence.
https://doi.org/10.1609/aaai.v38i9.28811
Brodnik, A.
, Miltersen, P. B. & Munro, J. I. (1997).
Trans-dichotomous algorithms without multiplication - some upper and lower bounds. I F. Dehne, A. Rau-Chaplin, J.-R. Sack & R. Tamassia (red.),
Algorithms and Data Structures: 5th International Workshop, WADS'97 Halifax, Nova Scotia, Canada August 6-8, 1997 Proceedings (s. 426-436). Springer.
https://doi.org/10.1007/3-540-63307-3_80
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
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
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
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
Bouras, C.
, Caragiannis, I., Gkamas, A., Protopapas, N., Sardelis, T. & Sgarbas, K. (2023).
State of the Art Analysis of Resource Allocation Techniques in 5G MIMO Networks. I
37th International Conference on Information Networking, ICOIN 2023 (s. 632-637). IEEE.
https://doi.org/10.1109/ICOIN56518.2023.10049018
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
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
Blanc, M.
& Hansen, K. A. (2021).
Computational Complexity of Multi-player Evolutionarily Stable Strategies. I R. Santhanam & D. Musatov (red.),
Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings (s. 1-17). Springer.
https://doi.org/10.1007/978-3-030-79416-31
Bilo, V.
, Caragiannis, I., Flammini, M., Igarashi, A., Monaco, G., Peters, D., Vinci, C. & Zwicker, W. (2022).
Almost envy-free allocations with connected bundles.
Games and Economic Behavior,
131, 197-221.
https://doi.org/10.1016/j.geb.2021.11.006
Bielikova, M.
, Nielsen, M., Kucera, A.
, Miltersen, P. B., Palamidessi, C., Tuma, P. & Valencia, F. (red.) (2009).
SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. Springer. Lecture Notes in Computer Science Bind 5404
https://doi.org/10.1007/978-3-540-95891-8
Barrington, D. A. M., Lu, C.-J.
, Miltersen, P. B. & Skyum, S. (1998).
Searching constant width mazes captures the AC0 hierarchy. I M. Morvan, C. Meinel & D. Krob (red.),
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 25-27, 1998 Proceedings (s. 73-83). Springer.
https://doi.org/10.1007/BFb0028550