Papers
All-Pay Bidding Games on Graphs
Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination
Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas et al.
Multiagent Evaluation Mechanisms
Tal Alon, Magdalen Dobson, Ariel Procaccia et al.
The Impact of Selfishness in Hypergraph Hedonic Games
Alessandro Aloisio, Michele Flammini, Cosimo Vinci
Swap Stability in Schelling Games on Graphs
Aishwarya Agarwal, Edith Elkind, Jiarui Gan et al.
Distance-Based Equilibria in Normal-Form Games
Erman Acar, Reshef Meir
Draft and Edit: Automatic Storytelling Through Multi-Pass Hierarchical Conditional Variational Autoencoder
Meng-Hsuan Yu, Juntao Li, Danyang Liu et al.
Fast and Robust Face-to-Parameter Translation for Game Character Auto-Creation
Tianyang Shi, Zhengxia Zuo, Yi Yuan et al.
A Character-Centric Neural Model for Automated Story Generation
Danyang Liu, Juntao Li, Meng-Hsuan Yu et al.
FET-GAN: Font and Effect Transfer via K-shot Adaptive Instance Normalization
Wei Li, Yongxing He, Yanwei Qi et al.
Narrative Planning Model Acquisition from Text Summaries and Descriptions
Thomas Hayton, Julie Porteous, Joao Ferreira et al.
Deep Reinforcement Learning for General Game Playing
Adrian Goldwaser, Michael Thielscher
Generating Interactive Worlds with Text
Angela Fan, Jack Urbanek, Pratik Ringshia et al.
Deep Neural Network Approximated Dynamic Programming for Combinatorial Optimization
Shenghe Xu, Shivendra S. Panwar, Murali Kodialam et al.
Explaining Propagators for String Edit Distance Constraints
Felix Winter, Nysret Musliu, Peter Stuckey
Constructing Minimal Perfect Hash Functions Using SAT Technology
Sean Weaver, Marijn Heule
Multiple Graph Matching and Clustering via Decayed Pairwise Matching Composition
Tianzhe Wang, Zetian Jiang, Junchi Yan
Probabilistic Inference for Predicate Constraint Satisfaction
Yuki Satake, Hiroshi Unno, Hinata Yanagi
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Prathyush Sambaturu, Aparna Gupta, Ian Davidson et al.
Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms
Tuhin Sahai, Anurag Mishra, Jose Miguel Pasini et al.
D-SPIDER-SFO: A Decentralized Optimization Algorithm with Faster Convergence Rate for Nonconvex Problems
Taoxing Pan, Jun Liu, Jie Wang
Grammar Filtering for Syntax-Guided Synthesis
Kairo Morton, William Hallahan, Elven Shum et al.
Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems
Jayanta Mandi, Emir Demirovi?, Peter J. Stuckey et al.