Các bài viết có thể truy cập công khai - Alexandros HollenderTìm hiểu thêm
Có tại một số nơi: 25
Maximum Nash welfare and other stories about EFX
G Amanatidis, G Birmpas, A Filos-Ratsikas, A Hollender, AA Voudouris
Theoretical Computer Science (TCS) 863, 69-85, 2021
Các cơ quan ủy nhiệm: Netherlands Organisation for Scientific Research, UK Engineering and …
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
J Fearnley, PW Goldberg, A Hollender, R Savani
Journal of the ACM (JACM) 70 (1), 7:1-7:74, 2022
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
PW Goldberg, A Hollender, W Suksompong
Journal of Artificial Intelligence Research (JAIR) 69, 109-141, 2020
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, European Commission
On the Complexity of Equilibrium Computation in First-Price Auctions
A Filos-Ratsikas, Y Giannakopoulos, A Hollender, P Lazos, D Poças
SIAM Journal on Computing (SICOMP) 52 (1), 80-131, 2023
Các cơ quan ủy nhiệm: German Research Foundation, Fundação para a Ciência e a Tecnologia, Portugal …
The Hairy Ball problem is PPAD-complete
PW Goldberg, A Hollender
Journal of Computer and System Sciences (JCSS) 122, 34-62, 2021
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Consensus-Halving: Does It Ever Get Easier?
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
SIAM Journal on Computing (SICOMP) 52 (2), 412-451, 2023
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, UK Engineering and …
Separations in proof complexity and TFNP
M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao
IEEE Symposium on Foundations of Computer Science (FOCS), 1150-1161, 2022
Các cơ quan ủy nhiệm: US Department of Energy, Natural Sciences and Engineering Research Council …
A topological characterization of modulo-p arguments and implications for necklace splitting
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2615-2634, 2021
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, UK Engineering and …
Consensus halving for sets of items
PW Goldberg, A Hollender, A Igarashi, P Manurangsi, W Suksompong
Mathematics of Operations Research (MOR) 47 (4), 3357–3379, 2022
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, European Commission …
Pure-circuit: Strong Inapproximability for PPAD
A Deligkas, J Fearnley, A Hollender, T Melissourgos
IEEE Symposium on Foundations of Computer Science (FOCS), 159-170, 2022
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
A Filos-Ratsikas, KA Hansen, K Høgh, A Hollender
IEEE Symposium on Foundations of Computer Science (FOCS), 827-838, 2022
Các cơ quan ủy nhiệm: Danish Council for Independent Research, UK Engineering and Physical …
Optimally Deceiving a Learning Leader in Stackelberg Games
G Birmpas, J Gan, A Hollender, FJ Marmolejo-Cossío, N Rajgopal, ...
Journal of Artificial Intelligence Research (JAIR) 72, 507-531, 2021
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, European Commission …
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
A Deligkas, A Filos-Ratsikas, A Hollender
Artificial Intelligence (AIJ) 313, 2022
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Constant inapproximability for PPA
A Deligkas, J Fearnley, A Hollender, T Melissourgos
ACM Symposium on Theory of Computing (STOC), 1010-1023, 2022
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, Federal Ministry of …
The Classes PPA-k: Existence from Arguments Modulo k
A Hollender
Theoretical Computer Science (TCS) 885, 15-29, 2021
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
The Frontier of Intractability for EFX with Two Agents
PW Goldberg, K Høgh, A Hollender
International Symposium on Algorithmic Game Theory (SAGT), 290-307, 2023
Các cơ quan ủy nhiệm: Danish Council for Independent Research
The complexity of computing KKT solutions of quadratic programs
J Fearnley, PW Goldberg, A Hollender, R Savani
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 892-903, 2024
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
PPAD-membership for problems with exact rational solutions: a general approach via convex optimization
A Filos-Ratsikas, KA Hansen, K Høgh, A Hollender
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1204-1215, 2024
Các cơ quan ủy nhiệm: Danish Council for Independent Research, UK Engineering and Physical …
Tight inapproximability for graphical games
A Deligkas, J Fearnley, A Hollender, T Melissourgos
AAAI Conference on Artificial Intelligence (AAAI), 5600-5607, 2023
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Pure-circuit: Tight inapproximability for PPAD
A Deligkas, J Fearnley, A Hollender, T Melissourgos
Journal of the ACM 71 (5), 1-48, 2024
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ