VLDB 2026 Research / reviewers in the wild / expert
Po-An Chen
dblp:25/1199
· DBLP profile ↗
16ranked-venue papers
9as first author
4since 2021 · last 2024
0000-0002-9891-6521ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 9 · 6 first-author · 4 since 2021Artificial intelligence and machine learning · 4 · 3 first-authorSystems, architecture and hardware · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Multiagent learning for competitive opinion optimization
Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin, An-Tzu Teng, Ke-Wei Fu |
Theor. Comput. Sci. | 1 |
| 2023 | Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform
Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin |
IWOCA | 4 |
| 2022 | An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria
Po-An Chen, Chi-Jen Lu, Yu-Sin Lu |
Theory Comput. Syst. | 1 |
| 2021 | How good is a two-party election game?
Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen |
Theor. Comput. Sci. | 3 |
| 2018 | Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time
Po-An Chen |
Inf. Process. Lett. | 1 |
| 2018 | Budget-constrained multi-battle contests: A new perspective and analysis
Chu-Han Cheng, Po-An Chen, Wing-Kai Hon |
Theor. Comput. Sci. | 2 |
| 2017 | Identification of Opinion Leaders and Followers in Social Media
Chun-Che Huang, Li-Ching Lien, Po-An Chen, Tzu-Liang (Bill) Tseng, Shian-Hua Lin |
DATA | 3 |
| 2016 | Generalized mirror descents in congestion games
Po-An Chen, Chi-Jen Lu |
Artif. Intell. | 1 |
| 2016 | Integrated model/scene construction through context-based search, data-driven suggestion and component replacement
Po-An Chen, Chuan-Kai Yang |
Multim. Tools Appl. | 1 |
| 2015 | Exploring social networking sites for facilitating multi-channel retailing
Yu-Teng Jang, Shuchih Ernest Chang, Po-An Chen |
Multim. Tools Appl. | 3 |
| 2014 | Agile Rough Set Based Rule Induction to Sustainable Service and Energy Provision
Chun-Che Huang, Tzu-Liang (Bill) Tseng, Yu-Sheng Liu, Jun-Wei Chu, Po-An Chen |
ICSEng | 5 |
| 2010 | Better vaccination strategies for better peopleabstractIn this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious disease breaks out at a random node of the graph and propagates along the edges of the graph. Vaccinated nodes cannot be infected, nor pass on the infection, whereas all other nodes do. The decisions on which nodes get vaccinated must be made before the random outbreak location is known. There is a cost associated with vaccination and a different cost with getting infected. Po-An Chen, Mary David, David Kempe 0001 |
EC | 1 |
| 2009 | Bayesian Auctions with Friends and Foes
Po-An Chen, David Kempe 0001 |
SAGT | 1 |
| 2008 | Altruism, selfishness, and spite in traffic routingabstractIn this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the "cost" perceived by a user is a linear combination of the actual latency of the route chosen (selfish component), and the increase in latency the user causes for others (altruistic component). We show that if all users have a coefficient of at least β > 0 for the altruistic component, then the price of anarchy is bounded by 1/β, for all network topologies, arbitrary commodities, and arbitrary semi-convex latency functions. We extend this result to give more precise bounds on the price of anarchy for specific classes of latency functions, even for β < 0 modeling spiteful behavior. In particular, we show that if all latency functions are linear, the price of anarchy is bounded by 4/(3+2β--β2). Po-An Chen, David Kempe 0001 |
EC | 1 |
| 2006 | Design of a low power mixed-signal RAKE receiverabstractRake receiving is a crucial technique in spread spectrum system. Typical rake receivers, implemented all-digitally, entail considerable power consumption. Though generally regarded as a promising low power solution, analog rake receivers have not been widely adopted because of formidable design complexity in integrating the overall analog and digital systems. In this paper, we present a practical scheme to realize a digitally-controlled mixed-signal rake receiver with both software and hardware simulation results demonstrating the efficiency of the proposed system. Synthesis and SPICE simulations using 0.18/spl mu/m CMOS technology show that the power consumption is less than 2.5 mW while operating at 16 MHz clock rate at 1.5 V supply voltage. Po-An Chen, Tzi-Dar Chiueh |
ISCAS | 1 |
| 2006 | Design of a MIMO OFDM baseband transceiver for cognitive radio systemabstractAs wireless communication services become more prevalent, bandwidth requirement increases dramatically. As such, the concept of cognitive radio (CR) has recently received much attention. In this paper, we present a MIMO-OFDM based CR system capable of dynamically adjusting its system parameters according to spectrum allocation. From system simulation, the proposed transceiver is shown to be a promising solution for CR applications. Jui-Ping Lien, Po-An Chen, Tzi-Dar Chiueh |
ISCAS | 2 |