Copertina

Mode Connectivity in Auction Design

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hertrich, Christoph, Tao, Yixin, Végh, László A.
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Computer Science and Game Theory Machine Learning Neural and Evolutionary Computing
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An Interpretable Automated Mechanism Design Framework with Large Language Models
di: Liu, Jiayuan, et al.
Pubblicazione: (2025)

Moderate Adaptive Linear Units (MoLU)
di: Koh, Hankyul, et al.
Pubblicazione: (2023)

Proximal Policy Optimization with Evolutionary Mutations
di: Czworkowski, Casimir, et al.
Pubblicazione: (2026)

Survival of the Fittest: Evolutionary Adaptation of Policies for Environmental Shifts
di: Paul, Sheryl, et al.
Pubblicazione: (2024)

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
di: Lin, Shishen
Pubblicazione: (2025)

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
di: Benford, Alistair, et al.
Pubblicazione: (2024)

Measuring the benefits of lying in MARA under egalitarian social welfare
di: Carrero, Jonathan, et al.
Pubblicazione: (2026)

Correlation of biological and computer viruses through evolutionary game theory
di: Kostadimas, Dimitris, et al.
Pubblicazione: (2021)

An Evolutionary Framework for Connect-4 as Test-Bed for Comparison of Advanced Minimax, Q-Learning and MCTS
di: Taylor, Henry, et al.
Pubblicazione: (2024)

Fair Distributed Machine Learning with Imbalanced Data as a Stackelberg Evolutionary Game
di: Niehaus, Sebastian, et al.
Pubblicazione: (2024)

An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem
di: Yang, Yang
Pubblicazione: (2024)

Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
di: Bertschinger, Daniel, et al.
Pubblicazione: (2022)

Words are not Wind -- How Public Joint Commitment and Reputation Solve the Prisoner's Dilemma
di: Krellner, Marcus, et al.
Pubblicazione: (2023)

Constitutional Arms Races in the Public Goods Game: Co-Evolving LLM Constitutions Under Cooperation-Defection Pressure
di: Kumar, Ujwal, et al.
Pubblicazione: (2026)

Governing Strategic Dynamics: Equilibrium Stabilization via Divergence-Driven Control
di: Shi, Hao, et al.
Pubblicazione: (2025)

Evolutionary Algorithms for Computing Nash Equilibria in Dynamic Games
di: Rezaee, Alireza
Pubblicazione: (2025)

Optimizing Cyber Response Time on Temporal Active Directory Networks Using Decoys
di: Ngo, Huy Q., et al.
Pubblicazione: (2024)

Multi-agent Path Finding for Timed Tasks using Evolutionary Games
di: Paul, Sheryl, et al.
Pubblicazione: (2024)

Federated Fairness Analytics: Quantifying Fairness in Federated Learning
di: Dilley, Oscar, et al.
Pubblicazione: (2024)

MOHAF: A Multi-Objective Hierarchical Auction Framework for Scalable and Fair Resource Allocation in IoT Ecosystems
di: Agrawal, Kushagra, et al.
Pubblicazione: (2025)

Evolving Personalities in Chaos: An LLM-Augmented Framework for Character Discovery in the Iterated Prisoners Dilemma under Environmental Stress
di: Yildirim, Oguzhan
Pubblicazione: (2026)

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
di: Hertrich, Christoph, et al.
Pubblicazione: (2020)

Evolutionary model for energy trading in community microgrids using Hawk-Dove strategies
di: Chifu, Viorica Rozina, et al.
Pubblicazione: (2025)

Training Neural Networks is NP-Hard in Fixed Dimension
di: Froese, Vincent, et al.
Pubblicazione: (2023)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
di: Hertrich, Christoph, et al.
Pubblicazione: (2021)

Cross-Entropy Games for Language Models: From Implicit Knowledge to General Capability Measures
di: Hongler, Clément, et al.
Pubblicazione: (2025)

Depth-Bounds for Neural Networks via the Braid Arrangement
di: Grillo, Moritz, et al.
Pubblicazione: (2025)

Tight Efficiency Bounds for the Probabilistic Serial and Related Mechanisms
di: Garg, Jugal, et al.
Pubblicazione: (2025)

Approximating Competitive Equilibrium by Nash Welfare
di: Garg, Jugal, et al.
Pubblicazione: (2024)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
di: Stargalla, Moritz, et al.
Pubblicazione: (2025)

Parameterized Hardness of Zonotope Containment and Neural Network Verification
di: Froese, Vincent, et al.
Pubblicazione: (2025)

Faster Dynamic Auctions via Polymatroid Sum
di: Eickhoff, Katharina, et al.
Pubblicazione: (2023)

Towards Lower Bounds on the Depth of ReLU Neural Networks
di: Hertrich, Christoph, et al.
Pubblicazione: (2021)

On the Depth of Monotone ReLU Neural Networks and ICNNs
di: Bakaev, Egor, et al.
Pubblicazione: (2025)

Better Neural Network Expressivity: Subdividing the Simplex
di: Bakaev, Egor, et al.
Pubblicazione: (2025)

Automated Deterministic Auction Design with Objective Decomposition
di: Duan, Zhijian, et al.
Pubblicazione: (2024)

What should a neuron aim for? Designing local objective functions based on information theory
di: Schneider, Andreas C., et al.
Pubblicazione: (2024)

A Robust Multi-Item Auction Design with Statistical Learning
di: Han, Jiale, et al.
Pubblicazione: (2023)

CHNNet: An Artificial Neural Network With Connected Hidden Neurons
di: Shahir, Rafiad Sadat, et al.
Pubblicazione: (2023)

Decomposition Polyhedra of Piecewise Linear Functions
di: Brandenburg, Marie-Charlotte, et al.
Pubblicazione: (2024)