default search action
Po-An Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Yu-Chen Cheng, Po-An Chen, Feng-Chi Chen, Ya-Wen Cheng:
Adversarial learning with optimism for bias reduction in machine learning. AI Ethics 4(4): 1389-1402 (2024) - [j14]Po-An Chen, Yi-Le Chen, Wei Lo:
Opinion Optimization for Two Different Social Objectives: Combinatorial Algorithms and Linear Program Rounding. J. Inf. Sci. Eng. 40(2): 217-230 (2024) - [j13]Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin
, An-Tzu Teng, Ke-Wei Fu:
Multiagent learning for competitive opinion optimization. Theor. Comput. Sci. 1017: 114787 (2024) - [i10]Yongge Yang, Yu-Ching Lee, Po-An Chen, Chuang-Chieh Lin:
Robustness of Online Proportional Response in Stochastic Online Fisher Markets: a Decentralized Approach. CoRR abs/2406.00160 (2024) - 2023
- [j12]Chuang-Chieh Lin
Group Formation by Group Joining and Opinion Updates Via Multi-Agent Online Gradient Ascent [AI-eXplained]. IEEE Comput. Intell. Mag. 18(4): 60-61 (2023) - [j11]Yongge Yang, Po-An Chen, Yu-Ching Lee
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. Optim. Lett. 17(8): 1853-1872 (2023) - [c20]Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. IWOCA 2023: 392-403 - [i9]Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen:
On the Efficiency of An Election Game of Two or More Parties: How Bad Can It Be? CoRR abs/2303.14405 (2023) - 2022
- [j10]Po-An Chen, Chi-Jen Lu, Yu-Sin Lu:
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria. Theory Comput. Syst. 66(1): 38-55 (2022) - [c19]Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin
Multiagent Learning for Competitive Opinion Optimization (Extended Abstract). ICS 2022: 61-72 - 2021
- [j9]Chuang-Chieh Lin
How good is a two-party election game? Theor. Comput. Sci. 871: 79-93 (2021) - [c18]Po-An Chen, Ya-Wen Cheng, Yao-Wei Tseng:
Mixed Integer Programming and LP Rounding for Opinion Maximization on Directed Acyclic Graphs. COMPLEX NETWORKS 2021: 867-878 - 2020
- [i8]Chuang-Chieh Lin
How Good Is a Two-Party Election Game? CoRR abs/2001.05692 (2020) - [i7]Yongge Yang, Yu-Ching Lee, Po-An Chen:
Competitive Demand Learning: a Data-Driven Pricing Algorithm. CoRR abs/2008.05195 (2020)
2010 – 2019
- 2019
- [c17]Atluri Hemanth
Investigations of Low Dynamic Ron on GaN/AlGaN/GaN HEMT by Field Plate Using Physical Device Simulations. ICSAI 2019: 249-252 - [c16]Manoj Kumar Reddy, Jhansi Lakshmi, Atluri Hemanth
Physics Based TCAD Simulation and Calibration of GaN/AlGaN/GaN HEMT Device. ICSAI 2019: 253-256 - [i6]Po-An Chen, Chi-Jen Lu:
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibrium. CoRR abs/1902.01754 (2019) - 2018
- [j8]Po-An Chen:
Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time. Inf. Process. Lett. 130: 36-39 (2018) - [j7]Chu-Han Cheng
Budget-constrained multi-battle contests: A new perspective and analysis. Theor. Comput. Sci. 721: 16-26 (2018) - [i5]Po-An Chen, Chi-Jen Lu:
Playing Stackelberg Opinion Optimization with Randomized Algorithms for Combinatorial Strategies. CoRR abs/1803.01792 (2018) - 2017
- [c15]Chun-Che Huang, Li-Ching Lien, Po-An Chen, Tzu-Liang Tseng, Shian-Hua Lin:
Identification of Opinion Leaders and Followers in Social Media. DATA 2017: 180-185 - 2016
- [j6]Po-An Chen, Chi-Jen Lu:
Generalized mirror descents in congestion games. Artif. Intell. 241: 217-243 (2016) - [j5]Po-An Chen, Chuan-Kai Yang:
Integrated model/scene construction through context-based search, data-driven suggestion and component replacement. Multim. Tools Appl. 75(18): 11555-11576 (2016) - [j4]Po-An Chen, Yi-Le Chen, Chi-Jen Lu:
Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games. Oper. Res. Lett. 44(6): 808-811 (2016) - [c14]Po-An Chen:
Generalized Mirror Descents with Non-Convex Potential Functions in Atomic Congestion Games. DOOR (Supplement) 2016: 558-562 - [i4]Po-An Chen, Yi-Le Chen, Chi-Jen Lu:
How Much of a Person Influencing the Others and Being Influenced Matters in Opinion Formation Games. CoRR abs/1602.02527 (2016) - [i3]Chu-Han Cheng, Po-An Chen, Wing-Kai Hon:
Budget-Constrained Multi-Battle Contests: A New Perspective and Analysis. CoRR abs/1602.04000 (2016) - [i2]Po-An Chen, Chi-Jen Lu:
Generalized Mirror Descents in Congestion Games. CoRR abs/1605.07774 (2016) - 2015
- [j3]Yu-Teng Jang, Shuchih Ernest Chang, Po-An Chen:
Exploring social networking sites for facilitating multi-channel retailing. Multim. Tools Appl. 74(1): 159-178 (2015) - [j2]Po-An Chen:
How egalitarian are Nash equilibria in network cost-sharing games? Oper. Res. Lett. 43(6): 564-566 (2015) - [c13]Po-An Chen, Chi-Jen Lu:
Playing Congestion Games with Bandit Feedbacks. AAMAS 2015: 1721-1722 - 2014
- [j1]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
Altruism and Its Impact on the Price of Anarchy. ACM Trans. Economics and Comput. 2(4): 17:1-17:45 (2014) - [c12]Po-An Chen, Chi-Jen Lu:
Generalized mirror descents in congestion games with splittable flows. AAMAS 2014: 1233-1240 - [c11]Chun-Che Huang, Tzu-Liang (Bill) Tseng, Yu-Sheng Liu, Jun-Wei Chu, Po-An Chen:
Agile Rough Set Based Rule Induction to Sustainable Service and Energy Provision. ICSEng 2014: 761-764 - 2011
- [c10]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
The Robust Price of Anarchy of Altruistic Games. WINE 2011: 383-390 - [i1]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
The Robust Price of Anarchy of Altruistic Games. CoRR abs/1112.3680 (2011) - 2010
- [c9]Po-An Chen, Mary David, David Kempe:
Better vaccination strategies for better people. EC 2010: 179-188
2000 – 2009
- 2009
- [c8]Xiaoxun Sun, William Yeoh, Po-An Chen, Sven Koenig:
Simple optimization techniques for A*-based search. AAMAS (2) 2009: 931-936 - [c7]Po-An Chen, David Kempe:
Bayesian Auctions with Friends and Foes. SAGT 2009: 335-346 - 2008
- [c6]Chung-Ti Hsu, Shu-Chuan Chen, Yen-Hsien Chen, Yu-Ti Su, Ming-Fang Lai, Che-Hung Chen, Po-An Chen:
Cumulative electrostatic discharge induced degradation of power-rail ESD clamp device in high-voltage CMOS/DMOS technologies. APCCAS 2008: 49-52 - [c5]Po-An Chen, David Kempe:
Altruism, selfishness, and spite in traffic routing. EC 2008: 140-149 - 2006
- [c4]Po-An Chen, Tzi-Dar Chiueh:
Design of a low power mixed-signal RAKE receiver. ISCAS 2006 - [c3]Jui-Ping Lien, Po-An Chen, Tzi-Dar Chiueh:
Design of a MIMO OFDM baseband transceiver for cognitive radio system. ISCAS 2006 - 2005
- [c2]Po-An Chen, Tyng-Ruey Chuang
Truthful Online Auctions for Pricing Peer-to-Peer Services. CEC 2005: 59-66 - 2004
- [c1]Chia-Hung Lien, Ying-Wen Bai, Ming-Bo Lin, Po-An Chen:
The saving of energy in Web server clusters by utilizing dynamic sever management. ICON 2004: 253-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: