Guardado en:
| Autores principales: | Berker, Ratip Emin, Casacuberta, Sílvia, Ong, Christopher, Robinson, Isaac |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2210.04880 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
por: Berker, Ratip Emin, et al.
Publicado: (2025)
por: Berker, Ratip Emin, et al.
Publicado: (2025)
Computing Optimal Equilibria in Repeated Games with Restarts
por: Berker, Ratip Emin, et al.
Publicado: (2024)
por: Berker, Ratip Emin, et al.
Publicado: (2024)
Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections
por: Zilberstein, Itai, et al.
Publicado: (2026)
por: Zilberstein, Itai, et al.
Publicado: (2026)
Beyond Symmetry in Repeated Games with Restarts
por: Fleischmann, Henry, et al.
Publicado: (2025)
por: Fleischmann, Henry, et al.
Publicado: (2025)
Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
por: Zhang, Brian Hu, et al.
Publicado: (2025)
por: Zhang, Brian Hu, et al.
Publicado: (2025)
Computational Social Choice: Research & Development
por: Baumeister, Dorothea, et al.
Publicado: (2026)
por: Baumeister, Dorothea, et al.
Publicado: (2026)
Expected Variational Inequalities
por: Zhang, Brian Hu, et al.
Publicado: (2025)
por: Zhang, Brian Hu, et al.
Publicado: (2025)
How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
por: Berker, Ratip Emin, et al.
Publicado: (2026)
por: Berker, Ratip Emin, et al.
Publicado: (2026)
Designing Rules to Pick a Rule: Aggregation by Consistency
por: Berker, Ratip Emin, et al.
Publicado: (2025)
por: Berker, Ratip Emin, et al.
Publicado: (2025)
Independence of Approximate Clones
por: Delemazure, Théo
Publicado: (2026)
por: Delemazure, Théo
Publicado: (2026)
Fair and Efficient Allocations Without Obvious Manipulations
por: Psomas, Alexandros, et al.
Publicado: (2022)
por: Psomas, Alexandros, et al.
Publicado: (2022)
Non-Obvious Manipulability in Additively Separable and Fractional Hedonic Games
por: Ferraioli, Diodato, et al.
Publicado: (2025)
por: Ferraioli, Diodato, et al.
Publicado: (2025)
Streamlining Equal Shares
por: Kraiczy, Sonja, et al.
Publicado: (2025)
por: Kraiczy, Sonja, et al.
Publicado: (2025)
On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
por: Berker, Ratip Emin, et al.
Publicado: (2025)
por: Berker, Ratip Emin, et al.
Publicado: (2025)
Artificial Intelligence Clones
por: Liang, Annie
Publicado: (2025)
por: Liang, Annie
Publicado: (2025)
Framing the Game: How Context Shapes LLM Decision-Making
por: Robinson, Isaac, et al.
Publicado: (2025)
por: Robinson, Isaac, et al.
Publicado: (2025)
The Value of Recall in Extensive-Form Games
por: Berker, Ratip Emin, et al.
Publicado: (2024)
por: Berker, Ratip Emin, et al.
Publicado: (2024)
Identifying Imperfect Clones in Elections
por: Faliszewski, Piotr, et al.
Publicado: (2025)
por: Faliszewski, Piotr, et al.
Publicado: (2025)
Subgame Optimal and Prior-Independent Online Algorithms
por: Hartline, Jason, et al.
Publicado: (2024)
por: Hartline, Jason, et al.
Publicado: (2024)
Non-uniformly Stable Common Independent Sets
por: Kamiyama, Naoyuki
Publicado: (2026)
por: Kamiyama, Naoyuki
Publicado: (2026)
Clone-Robust AI Alignment
por: Procaccia, Ariel D., et al.
Publicado: (2025)
por: Procaccia, Ariel D., et al.
Publicado: (2025)
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
por: Hollender, Alexandros, et al.
Publicado: (2024)
por: Hollender, Alexandros, et al.
Publicado: (2024)
On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
por: Gravin, Nick, et al.
Publicado: (2024)
por: Gravin, Nick, et al.
Publicado: (2024)
Clone-Robust Weights in Metric Spaces: Handling Redundancy Bias for Benchmark Aggregation
por: Berriaud, Damien, et al.
Publicado: (2025)
por: Berriaud, Damien, et al.
Publicado: (2025)
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
por: Main, James C. A.
Publicado: (2023)
por: Main, James C. A.
Publicado: (2023)
Settling the Competition Complexity of Additive Buyers over Independent Items
por: Derakhshan, Mahsa, et al.
Publicado: (2024)
por: Derakhshan, Mahsa, et al.
Publicado: (2024)
Mean-Field Games With Finitely Many Players: Independent Learning and Subjectivity
por: Yongacoglu, Bora, et al.
Publicado: (2022)
por: Yongacoglu, Bora, et al.
Publicado: (2022)
Breaking the Illusion of Artificial Consensus: Clone-Robust Weighting for Arbitrary Metric Spaces
por: Berriaud, Damien, et al.
Publicado: (2026)
por: Berriaud, Damien, et al.
Publicado: (2026)
Properties of the core and other solution concepts of Bel coalitional games in the ex-ante scenario
por: Grabisch, Michel, et al.
Publicado: (2026)
por: Grabisch, Michel, et al.
Publicado: (2026)
Cooperative games with uncertainty: a survey
por: Grabisch, Michel, et al.
Publicado: (2026)
por: Grabisch, Michel, et al.
Publicado: (2026)
Empirical Validation of the Independent Chip Model
por: Kim, Juho
Publicado: (2025)
por: Kim, Juho
Publicado: (2025)
Quantifying the Value of Revert Protection
por: Zhu, Brian Z., et al.
Publicado: (2024)
por: Zhu, Brian Z., et al.
Publicado: (2024)
Prior-Independent Bidding Strategies for First-Price Auctions
por: Kumar, Rachitesh, et al.
Publicado: (2025)
por: Kumar, Rachitesh, et al.
Publicado: (2025)
Deviation Ratings: A General, Clone-Invariant Rating Method
por: Marris, Luke, et al.
Publicado: (2025)
por: Marris, Luke, et al.
Publicado: (2025)
Low Cost, Fair, and Representative Committees in a Metric Space
por: Jerrett, Christopher, et al.
Publicado: (2025)
por: Jerrett, Christopher, et al.
Publicado: (2025)
Risk-Averse and Optimistic Advertiser Incentive Compatibility in Auto-bidding
por: Liaw, Christopher, et al.
Publicado: (2025)
por: Liaw, Christopher, et al.
Publicado: (2025)
Domain-Independent Game Abstraction using Word Embedding Techniques
por: Kim, Juho, et al.
Publicado: (2026)
por: Kim, Juho, et al.
Publicado: (2026)
Arena-Independent Finite-Memory Determinacy in Stochastic Games
por: Bouyer, Patricia, et al.
Publicado: (2021)
por: Bouyer, Patricia, et al.
Publicado: (2021)
Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
por: Dai, Yan, et al.
Publicado: (2024)
por: Dai, Yan, et al.
Publicado: (2024)
Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings
por: Bando, Keisuke, et al.
Publicado: (2025)
por: Bando, Keisuke, et al.
Publicado: (2025)
Ejemplares similares
-
From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
por: Berker, Ratip Emin, et al.
Publicado: (2025) -
Computing Optimal Equilibria in Repeated Games with Restarts
por: Berker, Ratip Emin, et al.
Publicado: (2024) -
Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections
por: Zilberstein, Itai, et al.
Publicado: (2026) -
Beyond Symmetry in Repeated Games with Restarts
por: Fleischmann, Henry, et al.
Publicado: (2025) -
Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
por: Zhang, Brian Hu, et al.
Publicado: (2025)