Copertina

Independence of Approximate Clones

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Delemazure, Théo
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computer Science and Game Theory Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Selecting the Most Conflicting Pair of Candidates
di: Delemazure, Théo, et al.
Pubblicazione: (2024)

Generalizing Instant Runoff Voting to Allow Indifferences
di: Delemazure, Théo, et al.
Pubblicazione: (2024)

Comparing Ways of Obtaining Candidate Orderings from Approval Ballots
di: Delemazure, Théo, et al.
Pubblicazione: (2024)

Obvious Independence of Clones
di: Berker, Ratip Emin, et al.
Pubblicazione: (2022)

Clone-Robust AI Alignment
di: Procaccia, Ariel D., et al.
Pubblicazione: (2025)

Domain-Independent Game Abstraction using Word Embedding Techniques
di: Kim, Juho, et al.
Pubblicazione: (2026)

Reallocating Wasted Votes in Proportional Parliamentary Elections with Thresholds
di: Delemazure, Théo, et al.
Pubblicazione: (2025)

Approximate Nash Equilibrium Learning for n-Player Markov Games in Dynamic Pricing
di: Liu, Larkin
Pubblicazione: (2022)

Approximating Human Strategic Reasoning with LLM-Enhanced Recursive Reasoners Leveraging Multi-agent Hypergames
di: Trencsenyi, Vince, et al.
Pubblicazione: (2025)

Two-Sided Time-Independent Regret for Matching Markets with Limited Interviews
di: Mirfakhar, Amirmahdi, et al.
Pubblicazione: (2026)

Approximate State Abstraction for Markov Games
di: Ishibashi, Hiroki, et al.
Pubblicazione: (2024)

Pushing the Frontier on Approximate EFX Allocations
di: Amanatidis, Georgios, et al.
Pubblicazione: (2024)

Approximate Proportionality in Online Fair Division
di: Choo, Davin, et al.
Pubblicazione: (2025)

Explore Reinforced: Equilibrium Approximation with Reinforcement Learning
di: Yu, Ryan, et al.
Pubblicazione: (2024)

Power and Limitations of Aggregation in Compound AI Systems
di: Ananthakrishnan, Nivasini, et al.
Pubblicazione: (2026)

Temporal Panel Selection in Ongoing Citizens' Assemblies
di: Kalayci, Yusuf Hakan, et al.
Pubblicazione: (2026)

Inequality in Congestion Games with Learning Agents
di: Michailidis, Dimitris, et al.
Pubblicazione: (2026)

Towards Model-Free Learning in Dynamic Population Games: An Application to Karma Economies
di: Cederle, Matteo, et al.
Pubblicazione: (2026)

Ex Ante Evaluation of AI-Induced Idea Diversity Collapse
di: Azad, Nafis Saami, et al.
Pubblicazione: (2026)

The Price of Paranoia: Robust Risk-Sensitive Cooperation in Non-Stationary Multi-Agent Reinforcement Learning
di: Ganguly, Deep Kumar, et al.
Pubblicazione: (2026)

Computing Thiele Rules on Interval Elections and their Generalizations
di: Avramidis, Dimitris, et al.
Pubblicazione: (2026)

High-Precision Estimation of the State-Space Complexity of Shogi via the Monte Carlo Method
di: Ishii, Sotaro, et al.
Pubblicazione: (2026)

Incentives, Equilibria, and the Limits of Healthcare AI: A Game-Theoretic Perspective
di: Ercole, Ari
Pubblicazione: (2026)

Sparse Probabilistic Coalition Structure Generation: Bayesian Greedy Pursuit and $\ell_1$ Relaxations
di: Majumdar, Angshul
Pubblicazione: (2026)

Differential Voting: Loss Functions For Axiomatically Diverse Aggregation of Heterogeneous Preferences
di: An, Zhiyu, et al.
Pubblicazione: (2026)

Dynamic Welfare-Maximizing Pooled Testing
di: Lopez, Nicholas, et al.
Pubblicazione: (2026)

Metric Hedonic Games on the Line
di: de la Haye, Merlin, et al.
Pubblicazione: (2026)

TERMS-Bench: Diagnosing LLM Negotiation Agents Beyond Deal Rate
di: Zhang, Erica, et al.
Pubblicazione: (2026)

Guiding the Recommender: Information-Aware Auto-Bidding for Content Promotion
di: Liu, Yumou, et al.
Pubblicazione: (2026)

From Competition to Collaboration: Designing Sustainable Mechanisms Between LLMs and Online Forums
di: Fono, Niv, et al.
Pubblicazione: (2026)

Strategic Bidding in 6G Spectrum Auctions with Large Language Models
di: Lotfi, Ismail, et al.
Pubblicazione: (2026)

Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections
di: Zilberstein, Itai, et al.
Pubblicazione: (2026)

KWBench: Measuring Unprompted Problem Recognition in Knowledge Work
di: Maloo, Ankit
Pubblicazione: (2026)

Mechanism Design Is Not Enough: Prosocial Agents for Cooperative AI
di: Huang, Xuanqiang Angelo, et al.
Pubblicazione: (2026)

Toward a Sustainable Federated Learning Ecosystem: A Practical Least Core Mechanism for Payoff Allocation
di: Ni, Zhengwei, et al.
Pubblicazione: (2026)

DIML: Differentiable Inverse Mechanism Learning from Behaviors of Multi-Agent Learning Trajectories
di: An, Zhiyu, et al.
Pubblicazione: (2026)

Institutional AI: Governing LLM Collusion in Multi-Agent Cournot Markets via Public Governance Graphs
di: Syrnikov, Marcantonio Bracale, et al.
Pubblicazione: (2026)

Reward Hacking as Equilibrium under Finite Evaluation
di: Wang, Jiacheng, et al.
Pubblicazione: (2026)

Linear Social Choice with Few Queries: A Moment-Based Approach
di: Ge, Luise, et al.
Pubblicazione: (2026)

Persona Vectors in Games: Measuring and Steering Strategies via Activation Vectors
di: Sun, Johnathan, et al.
Pubblicazione: (2026)