Cover Image

When does additional information lead to longer travel time in multi-origin-destination networks?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Xujin, Hu, Xiaodong, Jing, Xinqi, Tang, Zhongzheng
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When 1+1 does not equal 2: Synergy in games
by: Kritz, Joshua, et al.
Published: (2025)

Conditional cooperation with longer memory
by: Glynatsi, Nikoleta E., et al.
Published: (2024)

Flattening Supply Chains: When do Technology Improvements lead to Disintermediation?
by: Ali, S. Nageeb, et al.
Published: (2025)

Investigating the Impact of Subgraph Social Structure Preference on the Strategic Behavior of Networked Mixed-Motive Learning Agents
by: Gao, Xinqi, et al.
Published: (2026)

Sealed-bid Auctions on Blockchain with Timed Commitment Outsourcing
by: Li, Jichen, et al.
Published: (2024)

Robustness of voting mechanisms to external information in expectation
by: Chen, Yiling, et al.
Published: (2024)

Optimal network structure for collective performance with strategic information sharing
by: Wang, Ye, et al.
Published: (2026)

Urgency-aware Routing in Single Origin-destination Itineraries through Artificial Currencies
by: Pedroso, Leonardo, et al.
Published: (2023)

Multi-Winner Voting Games in TU and NTU: When is the Core Always Non-Empty?
by: Chen, Jiehua, et al.
Published: (2026)

Mechanism Design via Market Clearing-Prices for Value Maximizers under Budget and RoS Constraints
by: Liu, Xiaodong, et al.
Published: (2026)

Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
by: Deng, Xiaotie, et al.
Published: (2024)

When Contracts Get Complex: Information-Theoretic Barriers
by: Dütting, Paul, et al.
Published: (2024)

When is Truthfully Allocating Chores no Harder than Goods?
by: Li, Bo, et al.
Published: (2025)

Less-excludable Mechanism for DAOs in Public Good Auctions
by: Chen, Jing, et al.
Published: (2025)

Robustness of Stable Matchings When Attributes and Salience Determine Preferences
by: Ronen, Amit, et al.
Published: (2026)

p-additive games: a class of totally balanced games arising from inventory situations with temporary discounts
by: Meca, Ana, et al.
Published: (2024)

Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
by: Qiu, Jiawei, et al.
Published: (2024)

Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025)

When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
by: Geffner, Ivan, et al.
Published: (2025)

Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational
by: Alpern, Steve, et al.
Published: (2026)

When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results
by: Rong, Guozhen, et al.
Published: (2026)

From multi-allocations to allocations, with subadditive valuations
by: Feige, Uriel
Published: (2025)

Exact and approximate maximin share allocations in multi-graphs
by: Christodoulou, George, et al.
Published: (2025)

Diversity-seeking swap games in networks
by: Li, Yaqiao, et al.
Published: (2025)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
by: Kulkarni, Pooja, et al.
Published: (2025)

When to Deceive: A Cross-Layer Stackelberg Game Framework for Strategic Timing of Cyber Deception
by: Yang, Ya-Ting, et al.
Published: (2025)

An impossibility result for strongly group-strategyproof multi-winner approval-based voting
by: Caragiannis, Ioannis, et al.
Published: (2024)

Does multi-block MEV exist? Analysis of 2 years of MEV Data
by: Stichler, Pascal
Published: (2025)

A new lower bound for multi-color discrepancy with applications to fair division
by: Caragiannis, Ioannis, et al.
Published: (2025)

Resource Allocation and Pricing for Blockchain-enabled Metaverse: A Stackelberg Game Approach
by: Zhu, Zhanpeng, et al.
Published: (2025)

Submodular Participatory Budgeting
by: Yuan, Jing, et al.
Published: (2024)

Robust forecast aggregation via additional queries
by: Frongillo, Rafael, et al.
Published: (2025)

Bidding efficiently in Simultaneous Ascending Auctions with incomplete information using Monte Carlo Tree Search and determinization
by: Pacaud, Alexandre, et al.
Published: (2024)

Incentives for Early Arrival in Cost Sharing
by: Zhang, Junyu, et al.
Published: (2024)

Algorithms for Stable Roommate with Externalities
by: Leng, Jing, et al.
Published: (2025)

Learning a Game by Paying the Agents
by: Zhang, Brian Hu, et al.
Published: (2025)

Proportional Dynamics in Linear Fisher Markets with Auto-bidding: Convergence, Incentives and Fairness
by: Li, Juncheng, et al.
Published: (2024)

Price Competition in Linear Fisher Markets: Stability, Equilibrium and Personalization
by: Li, Juncheng, et al.
Published: (2024)

Vulnerabilities of Single-Round Incentive Compatibility in Auto-bidding: Theory and Evidence from ROI-Constrained Online Advertising Markets
by: Li, Juncheng, et al.
Published: (2022)

When Should a Principal Delegate to an Agent in Selection Processes?
by: Fish, Benjamin, et al.
Published: (2025)