Skip to content
conftrace_

polynomial time algorithm

104 papers

Papers

Approximating Nash Equilibria in Finite-Horizon Multi-Adversarial Team Markov Games UAI 2026 Cost-Free Neutrality for the River Method AAAI 2026 Efficient Learning and Symmetry Discovery under Exact Invariances COLT 2026 Online Fair Allocation with Demand-Side Time-Dependent Weight UAI 2026 Pacing Equilibria in Second-Price Auctions with Few Buyers AAAI 2026 Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division AAAI 2026 A Structural Complexity Analysis of Hierarchical Task Network Planning IJCAI 2025 Balanced and Fair Partitioning of Friends AAAI 2025 Computational Explorations of Total Variation Distance ICLR 2025 EFX Feasible Scheduling for Time-dependent Resources IJCAI 2025 Equilibria of the Colonel Blotto Games with Costs AAAI 2025 How to Resolve Envy by Adding Goods IJCAI 2025 Optimal Capacity Modification for Stable Matchings with Ties IJCAI 2025 Restructuring Tractable Probabilistic Circuits AISTATS 2025 Trade-Offs Between Information and Crowding in Sequential Decisions (Student Abstract) AAAI 2025 Understanding EFX Allocations: Counting and Variants AAAI 2025 An Exercise in Tournament Design: When Some Matches Must Be Scheduled AAAI 2024 Computational Aspects of Bayesian Persuasion under Approximate Best Response NeurIPS 2024 Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples IJCAI 2024 Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time NeurIPS 2024 Equilibrium Computation in Multidimensional Congestion Games: CSP and Learning Dynamics Approaches UAI 2024 Identification for Tree-Shaped Structural Causal Models in Polynomial Time AAAI 2024 Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions COLT 2024 Naive Bayes Classifiers over Missing Data: Decision and Poisoning ICML 2024 Nearly Equitable Allocations beyond Additivity and Monotonicity AAAI 2024