activity
20222024
most citedIncentives for Early Arrival in Cost Sharing

1 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

cs.GT2024★ 1 cited

Incentives for Early Arrival in Cost Sharing

Junyu Zhang, Yao Zhang, Yaoxin Ge +4

In cooperative games, we study how values created or costs incurred by a coalition are shared among the members within it, and the players may join the coalition in a online manner…

cs.AI2023

Leveraging Hyperbolic Embeddings for Coarse-to-Fine Robot Design

Heng Dong, Junyu Zhang, Chongjie Zhang

Multi-cellular robot design aims to create robots comprised of numerous cells that can be efficiently controlled to perform diverse tasks. Previous research has demonstrated the ab…

cs.GT2023

Connection Incentives in Cost Sharing Mechanisms with Budgets

Tianyi Zhang, Dengji Zhao, Junyu Zhang +1

In a cost sharing problem on a weighted undirected graph, all other nodes want to connect to the source node for some service. Each edge has a cost denoted by a weight and all the…

cs.GT2023

Cost Sharing under Private Costs and Connection Control on Directed Acyclic Graphs

Tianyi Zhang, Dengji Zhao, Junyu Zhang +1

We consider a cost sharing problem on a weighted directed acyclic graph (DAG) with a source node to which all the other nodes want to connect. The cost (weight) of each edge is pri…

cs.AI2023

Symmetry-Aware Robot Design with Structured Subgroups

Heng Dong, Junyu Zhang, Tonghan Wang +1

Robot design aims at learning to create robots that can be easily controlled and perform tasks efficiently. Previous works on robot design have proven its ability to generate robot…

cs.GT2023

Cost Sharing under Private Valuation and Connection Control

Tianyi Zhang, Junyu Zhang, Sizhe Gu +1

We consider a cost sharing problem on a weighted undirected graph, where all the nodes want to connect to a special node called source, and they need to share the total cost (weigh…

cs.GT2022★ 1 cited

Cost Sharing for Connectivity with Budget

Tianyi Zhang, Dengji Zhao, Junyu Zhang +1

We consider a cost sharing problem to connect all nodes in a weighted undirected graph, where the weight of each edge represents the cost to use the edge for the connectivity and t…