Paper "computational complexity" Papers
17 papers found
Conference
Balanced and Fair Partitioning of Friends
Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis et al.
Efficient Attention-Sharing Information Distillation Transformer for Lightweight Single Image Super-Resolution
Karam Park, Jae Woong Soh, Nam Ik Cho
Fair and Efficient Completion of Indivisible Goods
Vishwa Prakash HV, Ayumi Igarashi, Rohit Vaish
Learning More Expressive General Policies for Classical Planning Domains
Simon Ståhlberg, Blai Bonet, Hector Geffner
Memory-Reduced Meta-Learning with Guaranteed Convergence
Honglin Yang, Ji Ma, Xiao Yu
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
Antoine de Mathelin, Nicolas Enrique Cecchi, François Deheeger et al.
The Complexity of Extending Fair Allocations of Indivisible Goods
Argyrios Deligkas, Eduard Eiben, Robert Ganian et al.
The Cost Perspective of Liquid Democracy: Feasibility and Control
Shiri Alouf-Heffetz, Łukasz Janeczko, Grzegorz Lisowski et al.
A Class of Topological Pseudodistances for Fast Comparison of Persistence Diagrams
Rolando Kindelan Nuñez, Mircea Petrache, Mauricio Cerda et al.
Cost Minimization for Equilibrium Transition
Haoqiang Huang, Zihe Wang, Zhide Wei et al.
Envy-Free House Allocation under Uncertain Preferences
Haris Aziz, Isaiah Iliffe, Bo Li et al.
How to Make Knockout Tournaments More Popular?
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Non-flat ABA Is an Instance of Bipolar Argumentation
Markus Ulbricht, Nico Potyka, Anna Rapberger et al.
Reachability of Fair Allocations via Sequential Exchanges
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong et al.
Spatial Voting with Incomplete Voter Information
Aviram Imber, Jonas Israel, Markus Brill et al.
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono et al.
Unravelling Expressive Delegations: Complexity and Normative Analysis
Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind