Cover Image

Recognizing and Eliciting Weakly Single Crossing Profiles on Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Dey, Palash
Format:	Preprint
Published:	2016
Subjects:	Multiagent Systems Artificial Intelligence Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximizing Value in Challenge the Champ Tournaments
by: Bhaskar, Umang, et al.
Published: (2025)

Smooth Routing in Decaying Trees
by: Fluschnik, Till, et al.
Published: (2026)

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
by: Zhang, Taining, et al.
Published: (2023)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
by: Das, Arun Kumar, et al.
Published: (2025)

Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle
by: Kim, Jaekwang, et al.
Published: (2023)

Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading
by: Adiga, Abhijin, et al.
Published: (2024)

Time and Supply Fairness in Electricity Distribution using $k$-times bin packing
by: Baghel, Dinesh Kumar, et al.
Published: (2026)

Knapsack: Connectedness, Path, and Shortest-Path
by: Dey, Palash, et al.
Published: (2023)

Group Trip Planning Query Problem with Multimodal Journey
by: Ali, Dildar, et al.
Published: (2025)

On the Power of Spatial Locality on Online Routing Problems
by: Guragain, Swapnil, et al.
Published: (2025)

Query Complexity of Tournament Solutions
by: Maiti, Arnab, et al.
Published: (2016)

Optimally Improving Cooperative Learning in a Social Setting
by: Haddadan, Shahrzad, et al.
Published: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
by: Banik, Aritra, et al.
Published: (2025)

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
by: Cosson, Romain, et al.
Published: (2025)

Improved MMS Approximations for Few Agent Types
by: Garg, Jugal, et al.
Published: (2025)

Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Equilibria in multiagent online problems with predictions
by: Istrate, Gabriel, et al.
Published: (2024)

EFX Exists for Three Types of Agents
by: HV, Vishwa Prakash, et al.
Published: (2024)

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
by: Kulkarni, Pooja, et al.
Published: (2025)

Leakage-Robust Bayesian Persuasion
by: Haghtalab, Nika, et al.
Published: (2024)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)

Platforms for Efficient and Incentive-Aware Collaboration
by: Haghtalab, Nika, et al.
Published: (2024)

Group Fair Matchings using Convex Cost Functions
by: Panda, Atasi, et al.
Published: (2025)

Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)

Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Secure and secret cooperation in robotic swarms
by: Ferrer, Eduardo Castelló, et al.
Published: (2019)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)

Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
by: Csáji, Gergely
Published: (2023)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)

An Invertible State Space for Process Trees
by: Kolhof, Gero, et al.
Published: (2024)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
by: Hummel, Halvard, et al.
Published: (2024)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
by: Gupta, Aaryan, et al.
Published: (2023)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
by: Almansoori, Mahmood K. M., et al.
Published: (2025)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
by: Ehimwenma, Kennedy E., et al.
Published: (2025)

Knapsack on Graphs with Relaxed Neighborhood Constraints
by: Dey, Palash, et al.
Published: (2025)

Extremely Simple Streaming Forest
by: Xu, Haoyin, et al.
Published: (2021)