Literatura académica sobre el tema "Fairness constraints"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Fairness constraints".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Fairness constraints"
Detassis, Fabrizio, Michele Lombardi y Michela Milano. "Teaching the Old Dog New Tricks: Supervised Learning with Constraints". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 5 (18 de mayo de 2021): 3742–49. http://dx.doi.org/10.1609/aaai.v35i5.16491.
Texto completoBen-Porat, Omer, Fedor Sandomirskiy y Moshe Tennenholtz. "Protecting the Protected Group: Circumventing Harmful Fairness". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 6 (18 de mayo de 2021): 5176–84. http://dx.doi.org/10.1609/aaai.v35i6.16654.
Texto completoLi, Fengjiao, Jia Liu y Bo Ji. "Combinatorial Sleeping Bandits With Fairness Constraints". IEEE Transactions on Network Science and Engineering 7, n.º 3 (1 de julio de 2020): 1799–813. http://dx.doi.org/10.1109/tnse.2019.2954310.
Texto completoPi, Jiancai. "Fairness compatibility constraints and collective actions". Frontiers of Economics in China 2, n.º 4 (octubre de 2007): 644–52. http://dx.doi.org/10.1007/s11459-007-0033-x.
Texto completoVukadinović, Vladimir y Gunnar Karlsson. "Multicast scheduling with resource fairness constraints". Wireless Networks 15, n.º 5 (19 de diciembre de 2007): 571–83. http://dx.doi.org/10.1007/s11276-007-0085-y.
Texto completoWang, Xiao Fei, Xi Zhang, Yue Bing Chen, Lei Zhang y Chao Jing Tang. "Spectrum Assignment Algorithm Based on Clonal Selection in Cognitive Radio Networks". Advanced Materials Research 457-458 (enero de 2012): 931–39. http://dx.doi.org/10.4028/www.scientific.net/amr.457-458.931.
Texto completoPiron, Robert y Luis Fernandez. "Are fairness constraints on profit-seeking important?" Journal of Economic Psychology 16, n.º 1 (marzo de 1995): 73–96. http://dx.doi.org/10.1016/0167-4870(94)00037-b.
Texto completoZheng, Jiping, Yuan Ma, Wei Ma, Yanhao Wang y Xiaoyang Wang. "Happiness maximizing sets under group fairness constraints". Proceedings of the VLDB Endowment 16, n.º 2 (octubre de 2022): 291–303. http://dx.doi.org/10.14778/3565816.3565830.
Texto completoHeaton, Stephen. "FINALITY OR FAIRNESS?" Cambridge Law Journal 73, n.º 3 (noviembre de 2014): 477–80. http://dx.doi.org/10.1017/s0008197314000919.
Texto completoTan, Xianghua, Shasha Wang, Weili Zeng y Zhibin Quan. "A Collaborative Optimization Method of Flight Slots Considering Fairness Among Airports". Mathematical Problems in Engineering 2022 (10 de septiembre de 2022): 1–18. http://dx.doi.org/10.1155/2022/1418911.
Texto completoTesis sobre el tema "Fairness constraints"
Chandramouli, Shyam Sundar. "Network Resource Allocation Under Fairness Constraints". Thesis, 2014. https://doi.org/10.7916/D8S46Q3V.
Texto completoSyu, Wun-Hao y 徐文壕. "Maximizing Sum Capacity with Fairness Constraints in Multiuser OFDM Systems". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/54942351988603148574.
Texto completo國立中正大學
通訊工程研究所
95
Multiuser orthogonal frequency division multiplexing (Multiuser OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network (LAN) systems. Achieving high sum capacity under proportional fairness constraints is a popular research topic. The sum capacity of multiuser OFDM is maximized when each subchannel is assigned to the user with the best channel-to-noise ratio for that subchannel, with power subsequently distributed by water-filling. Under proportional fairness constraints, the sum capacity is maximized in [14]. In this paper, we present two resource allocation algorithms in multiuser OFDM systems that achieve higher sum capacity with variable proportional fairness constraints than [14]. The proposed optimization problem considers maximizing the sum capacity while maintaining proportional fairness among users for each channel realization. However, good proportional fairness reduces the sum capacity. There is a tradeoff between sum capacity and fairness deviation. Hence, the proposed suboptimal algorithms are created to increase sum capacity without causing too much fairness deviation. In these suboptimal algorithms, subchannel and power allocation are carried out separately. We use a simple method to determine the total transmit power for each user. This method is easy to implement. Simulation results show that the proposed algorithms achieve higher sum capacity than [14] and keep almost the same proportional fairness among users when data rate requirements are large enough. We show that fairness efficiency of our proposed algorithms is over three times better than [11] while maintaining almost the same proportional fairness among users for high date rate requirements. In addition, we also propose an algorithm which releases fairness deviation among users in order to achieve high capacity.
Yen, Pei Ru y 顏珮儒. "Short Sales Constraint, Price Discovery, Market Efficiency and Fairness-Taiwan Top50 Tracker Fund". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/69459538212700444514.
Texto completo國立政治大學
財務管理研究所
95
To some extent, almost all stock markets locate short-sell constraints on the short selling transactions process; however, they never do so to ETF thanks to its higher transparency and liquidity making it an easy supervised equity. Further, ETF could be considered as a good implication for the stock market simply owing to its exemption from short sell constraints that brings a strong demand and supply structure In other words, if the ETF price is not equal to its fund NAV (net asset value), investors could make profits by buying back or selling ETFs; in the long run, the price will reverse to its NAV and maintain on a reasonable level. As a result, we could infer that if the price could fully reflect investors’ diversified opinions, the market will be more efficient, and we could expect Taiwan stock market to forge ahead soon. Hence, the key issue lies in a healthy short selling mechanism. This paper tries to figure out whether short sell constraints on Taiwan stock market have significant influence on stock price and price efficiency. We use Taiwan50 index and TW50 ETF daily and intraday data from TEJ database, employee Event Study Method, select two dates as our event date which are “the listed date for TW50 ETF,” and “Taiwan 50 stocks exemption from short selling regulations,” and try to examine the difference before and after the date. Additionally, by summarizing and analyzing the trading frequency changes before or after the periods, we try to understand and estimate how the short sellers trading behavior would vary due to the implementation of regulation.
Silva, Frederico João Sousa da. "As isenções de IMI e de IMT nos conjuntos de prédios classificados como monumentos nacionais, de interesse público e de interesse municipal : uma questão de (in)coerência". Master's thesis, 2017. http://hdl.handle.net/10400.14/23805.
Texto completoIn order to pursue the public interest the State may use its power of authority to impose on its citizens a particular behaviour or its omission. The protection and enhancement of the Portuguese cultural heritage, which is constituted at the same time by the Portuguese language, Jerónimos Monastery in Lisbon and the viniculture on Ilha do Pico, is a matter of public interest and therefor arises as one of the Portuguese State’s fundamental tasks. In this endeavour, our focus was to identify and to understand what kind of legal instruments did the legislator use to protect and enhance the Portuguese Cultural heritage with private individuals. Public administrative constraints will thus play a prominent role in this work. Though the prior awareness of these public administrative legal measures is merely instrumental it proved to be fundamental to gain a broader and better informed perception about the legality and the constitutionality of the tax treatment that is given to the Portuguese cultural heritage. In this context it was given particular emphasis to the analysis of the scope of tax exemptions in place from the municipal property tax and the municipal property transfer tax on buildings listed as monuments, groups of buildings and sites. Through the establishment of tax relief measures and within the scope of Cultural Heritage Law, Tax Law plays its role on enhancing and protecting cultural heritage. Thus, the ultimate objective of this endeavour is to understand how these tax relief measures are applied and, essentially, assess if they are equally, fairly, and proportionally applied.
Du, Plessis Hanri Magdalena. "The harmonisation of good faith and ubuntu in the South African common law of contract". Thesis, 2017. http://hdl.handle.net/10500/23606.
Texto completoPrivate Law
LL. D.
Nikjah, Reza. "Performance evaluation and protocol design of fixed-rate and rateless coded relaying networks". Phd thesis, 2010. http://hdl.handle.net/10048/1674.
Texto completoCommunications
Libros sobre el tema "Fairness constraints"
Chandramouli, Shyam Sundar. Network Resource Allocation Under Fairness Constraints. [New York, N.Y.?]: [publisher not identified], 2014.
Buscar texto completoAlex, Whiting. Part V Fairness and Expeditiousness of ICC Proceedings, 40 Disclosure Challenges at the ICC. Oxford University Press, 2015. http://dx.doi.org/10.1093/law/9780198705161.003.0040.
Texto completoTadros, Victor. To Do, To Die, To Reason Why. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198831549.001.0001.
Texto completoRetallack, James. The Struggle Against Revolution. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199668786.003.0005.
Texto completoKarim A A, Khan QC y Buisman Caroline. Part V Fairness and Expeditiousness of ICC Proceedings, 41 Sitting on Evidence?: Systemic Failings in the ICC Disclosure Regime—Time for Reform. Oxford University Press, 2015. http://dx.doi.org/10.1093/law/9780198705161.003.0041.
Texto completoBartley, Tim. Rules without Rights. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198794332.001.0001.
Texto completoCapítulos de libros sobre el tema "Fairness constraints"
Baier, Christel, Marcus Groesser y Frank Ciesinski. "Quantitative Analysis under Fairness Constraints". En Automated Technology for Verification and Analysis, 135–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04761-9_12.
Texto completoAllen Emerson, E. y Chin-Laung Lei. "Temporal reasoning under generalized fairness constraints". En STACS 86, 21–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-16078-7_62.
Texto completoGullo, Francesco, Lucio La Cava, Domenico Mandaglio y Andrea Tagarelli. "When Correlation Clustering Meets Fairness Constraints". En Discovery Science, 302–17. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-18840-4_22.
Texto completoPuhakka, Antti. "Using Fairness Constraints in Process-Algebraic Verification". En Theoretical Aspects of Computing – ICTAC 2005, 546–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11560647_36.
Texto completoDorleon, Ginel, Imen Megdiche, Nathalie Bricon-Souf y Olivier Teste. "Feature Selection Under Fairness and Performance Constraints". En Big Data Analytics and Knowledge Discovery, 125–30. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12670-3_11.
Texto completoJoung, Yuh-Jzer. "Localizability of Fairness Constraints and their Distributed Implementations". En CONCUR’99 Concurrency Theory, 336–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48320-9_24.
Texto completoXu, Ziqi, Jixue Liu, Debo Cheng, Jiuyong Li, Lin Liu y Ke Wang. "Disentangled Representation with Causal Constraints for Counterfactual Fairness". En Advances in Knowledge Discovery and Data Mining, 471–82. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33374-3_37.
Texto completoWang, Jingbo, Yannan Li y Chao Wang. "Synthesizing Fair Decision Trees via Iterative Constraint Solving". En Computer Aided Verification, 364–85. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13188-2_18.
Texto completoParaschakis, Dimitris y Bengt J. Nilsson. "Matchmaking Under Fairness Constraints: A Speed Dating Case Study". En Communications in Computer and Information Science, 43–57. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-52485-2_5.
Texto completoKrasanakis, Emmanouil, Symeon Papadopoulos y Ioannis Kompatsiaris. "Applying Fairness Constraints on Graph Node Ranks Under Personalization Bias". En Complex Networks & Their Applications IX, 610–22. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65351-4_49.
Texto completoActas de conferencias sobre el tema "Fairness constraints"
Padala, Manisha y Sujit Gujar. "FNNC: Achieving Fairness through Neural Networks". En Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/315.
Texto completoCelis, L. Elisa, Lingxiao Huang, Vijay Keswani y Nisheeth K. Vishnoi. "Classification with Fairness Constraints". En FAT* '19: Conference on Fairness, Accountability, and Transparency. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3287560.3287586.
Texto completoCelis, L. Elisa, Lingxiao Huang y Nisheeth K. Vishnoi. "Multiwinner Voting with Fairness Constraints". En Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/20.
Texto completoCohen, Maxime C., Adam N. Elmachtoub y Xiao Lei. "Price Discrimination with Fairness Constraints". En FAccT '21: 2021 ACM Conference on Fairness, Accountability, and Transparency. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3442188.3445864.
Texto completoDorleon, Ginel, Imen Megdiche, Nathalie Bricon-Souf y Olivier Teste. "Feature selection under fairness constraints". En SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3477314.3507168.
Texto completoXu, Huanle, Yang Liu, Wing Cheong Lau y Rui Li. "Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints". En Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/354.
Texto completoKobren, Ari, Barna Saha y Andrew McCallum. "Paper Matching with Local Fairness Constraints". En KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3292500.3330899.
Texto completoLi, Fengjiao, Jia Liu y Bo Ji. "Combinatorial Sleeping Bandits with Fairness Constraints". En IEEE INFOCOM 2019 - IEEE Conference on Computer Communications. IEEE, 2019. http://dx.doi.org/10.1109/infocom.2019.8737461.
Texto completoXu, Weiting, Jie Hu, Shengdong Du y Yan Yang. "K-Means Clustering with Fairness Constraints". En 2021 16th International Conference on Intelligent Systems and Knowledge Engineering (ISKE). IEEE, 2021. http://dx.doi.org/10.1109/iske54062.2021.9755376.
Texto completoZeng, Yuchen, Hongxu Chen y Kangwook Lee. "Federated Learning with Local Fairness Constraints". En 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206590.
Texto completo