27 citations · 31 across the 9 of their papers we have counts for
11 papers
EF1-Constrained Nash Social Welfare with Identical Additive Valuations: Complexity, Guarantees, and Experiments
Zih-Sian Yang, Yi-Hao Chen, Yu-Te Kuan +3
We study the allocation of indivisible goods among agents with identical additive valuations, focusing on envy-freeness up to one good (EF1) and Nash social welfare (NSW). Since ev…
Resolving Envy by Adding Goods with Bounded Supply: A Type-Count Dichotomy and Two-Agent Hardness
Chuang-Chieh Lin, Guillaume Fertin, Po-An Chen +4
We study envy elimination by adding goods (EEAG) when the additional pool has bounded supply and no separate budget bound. We establish a sharp type-count dichotomy for binary addi…
A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen +1
We study organizational elections in which each group nominates one candidate and receives as payoff its members expected utility under a probabilistic winning rule. We empirically…
How Good Is a Two-Party Election Game?
Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen
In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two…
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria
Po-An Chen, Chi-Jen Lu, Yu-Sin Lu
Motivated by the convergence result of mirror-descent algorithms to market equilibria in linear Fisher markets, it is natural for one to consider designing dynamics (specifically,…
Multiagent Learning for Competitive Opinion Optimization
Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin +1
From a perspective of designing or engineering for opinion formation games in social networks, the "opinion maximization (or minimization)" problem has been studied mainly for desi…
Generalized Mirror Descents in Congestion Games
Po-An Chen, Chi-Jen Lu
Different types of dynamics have been studied in repeated game play, and one of them which has received much attention recently consists of those based on "no-regret" algorithms fr…
Budget-Constrained Multi-Battle Contests: A New Perspective and Analysis
Chu-Han Cheng, Po-An Chen, Wing-Kai Hon
In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multi…
Bounds on the Price of Anarchy for a More General Class of Directed Graphs in Opinion Formation Games
Po-An Chen, Yi-Le Chen, Chi-Jen Lu
In opinion formation games with directed graphs, a bounded price of anarchy is only known for weighted Eulerian graphs. Thus, we bound the price of anarchy for a more general class…
Bayesian Auctions with Friends and Foes
Po-An Chen, David Kempe
We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction,…
The Robust Price of Anarchy of Altruistic Games
Po-An Chen, Bart de Keijzer, David Kempe +1
We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cos…