Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3446)
- Software Engineering (2149)
- Artificial Intelligence and Robotics (1675)
- Information Security (1059)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (924)
- Engineering (858)
- Social and Behavioral Sciences (661)
- Business (627)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (400)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (178)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (101)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (123)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (53)
- Security (53)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 4891 - 4920 of 8495
Full-Text Articles in Computer Sciences
Cost Sensitive Online Multiple Kernel Classification, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi
Cost Sensitive Online Multiple Kernel Classification, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Learning from data streams has been an important open research problem in the era of big data analytics. This paper investigates supervised machine learning techniques for mining data streams with application to online anomaly detection. Unlike conventional machine learning tasks, machine learning from data streams for online anomaly detection has several challenges: (i) data arriving sequentially and increasing rapidly, (ii) highly class-imbalanced distributions; and (iii) complex anomaly patterns that could evolve dynamically.To tackle these challenges, we propose a novel Cost-Sensitive Online Multiple Kernel Classification (CSOMKC) scheme for comprehensively mining data streams and demonstrate its application to online anomaly detection. Specifically, …
An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys, Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Jian Weng
An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys, Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Jian Weng
Research Collection School Of Computing and Information Systems
In this paper, we propose a toolkit for efficient and privacy-preserving outsourced calculation under multiple encrypted keys (EPOM). Using EPOM, a large scale of users can securely outsource their data to a cloud server for storage. Moreover, encrypted data belonging to multiple users can be processed without compromising on the security of the individual user's (original) data and the final computed results. To reduce the associated key management cost and private key exposure risk in EPOM, we present a distributed two-trapdoor public-key cryptosystem, the core cryptographic primitive. We also present the toolkit to ensure that the commonly used integer operations …
What Permissions Should This Android App Request?, Lingfeng Bao, David Lo, Xin Xia, Shanping Li
What Permissions Should This Android App Request?, Lingfeng Bao, David Lo, Xin Xia, Shanping Li
Research Collection School Of Computing and Information Systems
As Android is one of the most popular open source mobile platforms, ensuring security and privacy of Android applications is very important. Android provides a permission mechanism which requires developers to declare sensitive resources their applications need, and users need to agree with this request when they install (for Android API level 22 or lower) or run (for Android API level 23) these applications. Although Android provides very good official documents to explain how to properly use permissions, unfortunately misuses even for the most popular permissions have been reported. Recently, Karim et al. propose an association rule mining based approach …
Spiteful, One-Off, And Kind: Predicting Customer Feedback Behavior On Twitter, Agus Sulistya, Abhishek Sharma, David Lo
Spiteful, One-Off, And Kind: Predicting Customer Feedback Behavior On Twitter, Agus Sulistya, Abhishek Sharma, David Lo
Research Collection School Of Computing and Information Systems
Social media provides a convenient way for customers to express their feedback to companies. Identifying different types of customers based on their feedback behavior can help companies to maintain their customers. In this paper, we use a machine learning approach to predict a customer’s feedback behavior based on her first feedback tweet. First, we identify a few categories of customers based on their feedback frequency and the sentiment of the feedback. We identify three main categories: spiteful, one-off, and kind. Next, we build a model to predict the category of a customer given her first feedback. We use profile and …
How To Break An Api: Cost Negotiation And Community Values In Three Software Ecosystems, Christopher Bogart, Christian K\303\244stner, James Herbsleb, Ferdian Thung
How To Break An Api: Cost Negotiation And Community Values In Three Software Ecosystems, Christopher Bogart, Christian K\303\244stner, James Herbsleb, Ferdian Thung
Research Collection School Of Computing and Information Systems
Change introduces conict into software ecosystems: breaking changes may ripple through the ecosystem and trigger rework for users of a package, but often developers can invest additional effort or accept opportunity costs to alleviate or delay downstream costs. We performed a multiple case study of three software ecosystems with different tooling and philosophies toward change, Eclipse, R/CRAN, and Node.js/npm, to understand how developers make decisions about change and change-related costs and what practices, tooling, and policies are used. We found that all three ecosystems differ substantially in their practices and expectations toward change and that those differences can be explained …
Ownership-Hidden Group-Oriented Proofs Of Storage From Pre-Homomorphic Signatures, Yujue Wang, Qianhong Wu, Bo Qin, Xiaofeng Chen, Xinyi Huang, Jungang Lou
Ownership-Hidden Group-Oriented Proofs Of Storage From Pre-Homomorphic Signatures, Yujue Wang, Qianhong Wu, Bo Qin, Xiaofeng Chen, Xinyi Huang, Jungang Lou
Research Collection School Of Computing and Information Systems
In this paper, we study the problem of secure cloud storage in a multi-user setting such that the ownership of outsourced files can be hidden against the cloud server. There is a group manager for initiating the system, who is also responsible for issuing private keys for the involved group members. All authorized members are able to outsource files to the group’s storage account at some cloud server. Although the ownership of outsourced file is preserved against the cloud server, the group manager could trace the true identity of any suspicious file for liability investigation. To address this issue, we …
On Profiling Bots In Social Media, Richard J. Oentaryo, Arinto Murdopo, Philips K. Prasetyo, Ee Peng Lim
On Profiling Bots In Social Media, Richard J. Oentaryo, Arinto Murdopo, Philips K. Prasetyo, Ee Peng Lim
Research Collection School Of Computing and Information Systems
The popularity of social media platforms such as Twitter has led to the proliferation of automated bots, creating both opportunities and challenges in information dissemination, user engagements, and quality of services. Past works on profiling bots had been focused largely on malicious bots, with the assumption that these bots should be removed. In this work, however, we find many bots that are benign, and propose a new, broader categorization of bots based on their behaviors. This includes broadcast, consumption, and spam bots. To facilitate comprehensive analyses of bots and how they compare to human accounts, we develop a systematic profiling …
Achieving Ind-Cca Security For Functional Encryption For Inner Products, Shiwei Zhang, Yi Mu, Guomin Yang
Achieving Ind-Cca Security For Functional Encryption For Inner Products, Shiwei Zhang, Yi Mu, Guomin Yang
Research Collection School Of Computing and Information Systems
Functional encryption allows the authorised parties to reveal partial information of the plaintext hidden in a ciphertext while in conventional encryption decryption is all-or-nothing. Focusing on the functionality of inner product evaluation (i.e. given vectors xxxx and yyyy, calculate ⟨xx,yy⟩⟨xx,yy⟩), Abdalla et al. (PKC 2015) proposed a functional encryption scheme for inner product functionality (FE-IP) with s-IND-CPA security. In some recent works by Abdalla et al. (eprint: Report 2016/11) and Agrawal et al. (CRYPTO 2016), IND-CPA secure FE-IP schemes have also been proposed. In order to achieve Indistinguishable under Chosen Ciphertext Attacks (IND-CCA security) for FE-IP, in this paper, we …
On The Security Of Two Identity-Based Conditional Proxy Re-Encryption Schemes, Kai He, Jian Weng, Robert H. Deng, Joseph K. Liu
On The Security Of Two Identity-Based Conditional Proxy Re-Encryption Schemes, Kai He, Jian Weng, Robert H. Deng, Joseph K. Liu
Research Collection School Of Computing and Information Systems
Proxy re-encryption allows a semi-trusted proxy with a re-encryption key to convert a delegator's ciphertext into a delegatee's ciphertext, and the semi-trusted proxy cannot learn anything about the underlying plaintext. If a proxy re-encryption scheme is indistinguishable against chosen-ciphertext attacks, its initialized ciphertext should be non-malleable. Otherwise, there might exist an adversary who can break the chosen-ciphertext security of the scheme. Recently, Liang et al. proposed two proxy re-encryption schemes. They claimed that their schemes were chosen-ciphertext secure in the standard model. However, we find that the original ciphertext in their schemes are malleable. Thus, we present some concrete attacks …
Privacy-Preserving Outsourced Calculation On Floating Point Numbers, Ximeng Liu, Robert H. Deng, Wenxiu Ding, Rongxing Lu
Privacy-Preserving Outsourced Calculation On Floating Point Numbers, Ximeng Liu, Robert H. Deng, Wenxiu Ding, Rongxing Lu
Research Collection School Of Computing and Information Systems
In this paper, we propose a framework for privacy-preserving outsourced calculation on floating point numbers (POCF). Using POCF, a user can securely outsource the storing and processing of floating point numbers to a cloud server without compromising on the security of the (original) data and the computed results. In particular, we first present privacy-preserving integer processing protocols for common integer operations. We then present an approach to outsourcing floating point numbers for storage in a privacy-preserving way, and securely processing commonly used floating point number operations on-the-fly. We prove that the proposed POCF achieves the goal of floating point number …
Proteus: Computing Disjunctive Loop Summary Via Path Dependency Analysis, Xiaofei Xie, Bihuan Chen, Yang Liu, Wei Le, Xiaohong Li
Proteus: Computing Disjunctive Loop Summary Via Path Dependency Analysis, Xiaofei Xie, Bihuan Chen, Yang Liu, Wei Le, Xiaohong Li
Research Collection School Of Computing and Information Systems
Loops are challenging structures for program analysis, especially when loops contain multiple paths with complex interleaving executions among these paths. In this paper, we first propose a classification of multi-path loops to understand the complexity of the loop execution, which is based on the variable updates on the loop conditions and the execution order of the loop paths. Secondly, we propose a loop analysis framework, named Proteus, which takes a loop program and a set of variables of interest as inputs and summarizes path-sensitive loop effects on the variables. The key contribution is to use a path dependency automaton (PDA) …
Static Loop Analysis And Its Applications, Xiaofei Xie
Static Loop Analysis And Its Applications, Xiaofei Xie
Research Collection School Of Computing and Information Systems
Loops are challenging structures in program analysis, and an effective loop analysis is crucial in the applications, such as symbolic execution and program verification. In the research, we will first perform a deep analysis and propose a classification according to the complexity of the loops. Then try to propose techniques for analyzing and summarizing different loops. At last, we apply the techniques in multiple applications.
A Method Of Integrating Correlation Structures For A Generalized Recursive Route Choice Model, Tien Mai
A Method Of Integrating Correlation Structures For A Generalized Recursive Route Choice Model, Tien Mai
Research Collection School Of Computing and Information Systems
We propose a way to estimate a generalized recursive route choice model. The model generalizes other existing recursive models in the literature, i.e., (Fosgerau et al., 2013b; Mai et al., 2015c), while being more flexible since it allows the choice at each stage to be any member of the network multivariate extreme value (network MEV) model (Daly and Bierlaire, 2006). The estimation of the generalized model requires defining a contraction mapping and performing contraction iterations to solve the Bellman’s equation. Given the fact that the contraction mapping is defined based on the choice probability generating functions (CPGF) (Fosgerau et al., …
Hierarchical Visualization Of Video Search Results For Topic-Based Browsing, Yu-Gang Jiang, Jiajun Wang, Qiang Wang, Wei Liu, Chong-Wah Ngo
Hierarchical Visualization Of Video Search Results For Topic-Based Browsing, Yu-Gang Jiang, Jiajun Wang, Qiang Wang, Wei Liu, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Existing video search engines return a ranked list of videos for each user query, which is not convenient for browsing the results of query topics that have multiple facets, such as the "early life," "personal life," and "presidency" of a query "Barack Obama." Organizing video search results into semantically structured hierarchies with nodes covering different topic facets can significantly improve the browsing efficiency for such queries. In this paper, we introduce a hierarchical visualization approach for video search result browsing, which can help users quickly understand the multiple facets of a query topic in a very well-organized manner. Given a …
Summarization Of Egocentric Videos: A Comprehensive Survey, Ana Garcia Del Molino, Cheston Tan, Joo-Hwee Lim, Ah-Hwee Tan
Summarization Of Egocentric Videos: A Comprehensive Survey, Ana Garcia Del Molino, Cheston Tan, Joo-Hwee Lim, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
The introduction of wearable video cameras (e.g., GoPro) in the consumer market has promoted video life-logging, motivating users to generate large amounts of video data. This increasing flow of first-person video has led to a growing need for automatic video summarization adapted to the characteristics and applications of egocentric video. With this paper, we provide the first comprehensive survey of the techniques used specifically to summarize egocentric videos. We present a framework for first-person view summarization and compare the segmentation methods and selection algorithms used by the related work in the literature. Next, we describe the existing egocentric video datasets …
A Decomposition Method For Estimating Recursive Logit Based Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger
A Decomposition Method For Estimating Recursive Logit Based Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger
Research Collection School Of Computing and Information Systems
Fosgerau et al. (2013) recently proposed the recursive logit (RL) model for route choice problems, that can be consistently estimated and easily used for prediction without any sampling of choice sets. Its estimation however requires solving many large-scale systems of linear equations, which can be computationally costly for real data sets. We design a decomposition (DeC) method in order to reduce the number of linear systems to be solved, opening the possibility to estimate more complex RL based models, for instance mixed RL models. We test the performance of the DeC method by estimating the RL model on two networks …
Grab Taxi: Navigating New Frontiers, Mei Lin, Christopher Dula
Grab Taxi: Navigating New Frontiers, Mei Lin, Christopher Dula
Research Collection School Of Computing and Information Systems
In mid-2016, Anthony Tan, the CEO of Grab, an on-demand transportation-app company serving Southeast Asia, was locked in a high stakes struggle to win the hearts and minds of drivers, passengers and regulators alike. Valued at an estimated US$1.5 billion, Grab (known among consumers as ‘GrabTaxi’) had become one of Asia’s most successful start-ups.
Editorial: Trust Management For Multimedia Big Data, Zheng Yan, Jun Liu, Deng, Robert H., Francisco Herrera
Editorial: Trust Management For Multimedia Big Data, Zheng Yan, Jun Liu, Deng, Robert H., Francisco Herrera
Research Collection School Of Computing and Information Systems
No abstract provided.
Partitioning Uncertain Workloads, Freddy Chua, Bernardo A. Huberman
Partitioning Uncertain Workloads, Freddy Chua, Bernardo A. Huberman
Research Collection School Of Computing and Information Systems
We present a method for determining the ratio of the tasks when breaking any complex workload in such a way that once the outputs from all tasks are joined, their full completion takes less time and exhibit smaller variance than when running on the undivided workload. To do that, we have to infer the capabilities of the processing unit executing the divided workloads or tasks. We propose a Bayesian Inference algorithm to infer the amount of time each task takes in a way that does not require prior knowledge on the processing unit capability. We demonstrate the effectiveness of this …
Content Sampling, Household Informedness, And The Consumption Of Digital Information Goods, Ai Phuong Hoang, Robert J. Kauffman
Content Sampling, Household Informedness, And The Consumption Of Digital Information Goods, Ai Phuong Hoang, Robert J. Kauffman
Research Collection School Of Computing and Information Systems
Technology and media are delivering content that is transforming society. Providers must compete for consumer attention to sell their digital information goods effectively. This is challenging, since there is a high level of uncertainty associated with the consumption of such goods. Service providers often use free programming to share product information. We examine the effectiveness of content sampling strategy used for on-demand series dramas, a unique class of entertainment goods. The data were extracted from a large set of household video-on-demand (VoD) viewing records and combined with external data sources. We extended a propensity score matching (PSM) approach to handle …
Message From The Chairs, Andrew Begel, Fabio Calefato, Christoph Treude
Message From The Chairs, Andrew Begel, Fabio Calefato, Christoph Treude
Research Collection School Of Computing and Information Systems
The Workshop on Social Software Engineering (SSE) focuses on the interplay between social computing and software engineering. On one hand, social factors in software engineering activities, processes and tools are essential for improving the quality of development processes and the software produced by them. Examples include the role of situational awareness and multi-cultural factors in collaborative software development. On the other hand, social software mediates people-to-people communication, supporting human choices, actions, and interactions with each other. Social software needs to accommodate a wide range of social concepts, such as trust, governance, reputation, and privacy. Being social, the software would also …
One-Round Attribute-Based Key Exchange In The Multi-Party Setting, Yangguang Tian, Guomin Yang, Yi Mu, Kaitai Liang, Yong Yu
One-Round Attribute-Based Key Exchange In The Multi-Party Setting, Yangguang Tian, Guomin Yang, Yi Mu, Kaitai Liang, Yong Yu
Research Collection School Of Computing and Information Systems
Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addition, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose …
Designing And Evaluating Business Process Models: An Experimental Approach, Yuecheng Martin Yu, Alexander Pelaez, Karl R. Lang
Designing And Evaluating Business Process Models: An Experimental Approach, Yuecheng Martin Yu, Alexander Pelaez, Karl R. Lang
Research Collection School Of Computing and Information Systems
This paper presents an experimental approach to compare the performance of alternative business process designs. We use an example case of an electronic group buying setting to demonstrate how our approach can be applied in practice. More specifically, we chose a standard business process, the sales process as implemented on a group buying platform, to illustrate how a business process may be redesigned in order to better meet the needs of customers. For that purpose, we introduce a social technology feature to support cooperation among buyers in the sales process and then analyze the performance impact of the proposed business …
Dissecting Developer Policy Violating Apps: Characterization And Detection, Su Mon Kywe, Yingjiu Li, Jason Hong, Yao Cheng
Dissecting Developer Policy Violating Apps: Characterization And Detection, Su Mon Kywe, Yingjiu Li, Jason Hong, Yao Cheng
Research Collection School Of Computing and Information Systems
To ensure quality and trustworthiness of mobile apps, Google Play store imposes various developer policies. Once an app is reported for exhibiting policy-violating behaviors, it is removed from the store to protect users. Currently, Google Play store relies on mobile users’ feedbacks to identify policy violations. Our paper takes the first step towards understanding these policy-violating apps. First, we crawl 302 Android apps, which are reported in the Reddit forum by mobile users for policy violations and are later removed from the Google Play store. Second, we perform empirical analysis, which reveals that many violating behaviors have not been studied …
Attractiveness Versus Competition: Towards An Unified Model For User Visitation, Thanh-Nam Doan, Ee-Peng Lim
Attractiveness Versus Competition: Towards An Unified Model For User Visitation, Thanh-Nam Doan, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Modeling user check-in behavior provides useful insights about venues as well as the users visiting them. These insights can be used in urban planning and recommender system applications. Unlike previous works that focus on modeling distance effect on user’s choice of check-in venues, this paper studies check-in behaviors affected by two venue-related factors, namely, area attractiveness and neighborhood competitiveness. The former refers to the ability of an area with multiple venues to collectively attract checkins from users, while the latter represents the ability of a venue to compete with its neighbors in the same area for check-ins. We first embark …
Determining Quality- And Energy-Aware Multiple Contexts In Pervasive Computing Environments, Nirmalya Roy, Archan Misra, Sajal K. Das, Christine Julien
Determining Quality- And Energy-Aware Multiple Contexts In Pervasive Computing Environments, Nirmalya Roy, Archan Misra, Sajal K. Das, Christine Julien
Research Collection School Of Computing and Information Systems
In pervasive computing environments, understanding the context of an entity is essential for adapting the application behavior to changing situations. In our view, context is a high-level representation of a user or entity's state and can capture location, activities, social relationships, capabilities, etc. Inherently, however, these high-level context metrics are difficult to capture using uni-modal sensors only and must therefore be inferred using multi-modal sensors. A key challenge in supporting context-aware pervasive computing is how to determine multiple high-level context metrics simultaneously and energy-efficiently using low-level sensor data streams collected from the environment and the entities present therein. A key …
Integrated Software Fingerprinting Via Neural-Network-Based Control Flow Obfuscation, Haoyu Ma, Ruiqi Li, Xiaoxu Yu, Chunfu Jia, Debin Gao
Integrated Software Fingerprinting Via Neural-Network-Based Control Flow Obfuscation, Haoyu Ma, Ruiqi Li, Xiaoxu Yu, Chunfu Jia, Debin Gao
Research Collection School Of Computing and Information Systems
Dynamic software fingerprinting has been an important tool in fighting against software theft and pirating by embedding unique fingerprints into software copies. However, existing work uses methods from dynamic software watermarking as direct solutions in which secret marks are inside rather independent code modules attached to the software. This results in an intrinsic weakness against targeted collusive attacks since differences among software copies correspond directly to the fingerprint-related components. In this paper, we suggest a novel mode of dynamic fingerprinting called integrated fingerprinting, of which the goal is to ensure all fingerprinted software copies possess identical behaviors at semantic level. …
When Machine Meets Society: Social Impacts Of Information And Information Economics, Eric K. Clemons, Rajiv M. Dewan, Robert John Kauffman, Thomas A. Weber
When Machine Meets Society: Social Impacts Of Information And Information Economics, Eric K. Clemons, Rajiv M. Dewan, Robert John Kauffman, Thomas A. Weber
Research Collection School Of Computing and Information Systems
No abstract provided.
Plackett-Luce Regression Mixture Model For Heterogeneous Rankings, Maksim Tkachenko, Hady W. Lauw
Plackett-Luce Regression Mixture Model For Heterogeneous Rankings, Maksim Tkachenko, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Learning to rank is an important problem in many scenarios, such as information retrieval, natural language processing, recommender systems, etc. The objective is to learn a function that ranks a number of instances based on their features. In the vast majority of the learning to rank literature, there is an implicit assumption that the population of ranking instances are homogeneous, and thus can be modeled by a single central ranking function. In this work, we are concerned with learning to rank for a heterogeneous population, which may consist of a number of sub-populations, each of which may rank objects dierently. …
Achieving Economic And Environmental Sustainabilities In Urban Consolidation Center With Bicriteria Auction, Stephanus Daniel Handoko, Hoong Chuin Lau, Shih-Fen Cheng
Achieving Economic And Environmental Sustainabilities In Urban Consolidation Center With Bicriteria Auction, Stephanus Daniel Handoko, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Consolidation lies at the heart of the last-mile logistics problem. Urban consolidation centers (UCCs) have been set up to facilitate such consolidation all over the world. To the best of our knowledge, most-if not all-of the UCCs operate on volume-based fixed-rate charges. To achieve environmental sustainability while ensuring economic sustainability in urban logistics, we propose, in this paper, a bicriteria auction mechanism for the automated assignment of last-mile delivery orders to transport resources. We formulate and solve the winner determination problem of the auction as a biobjective programming model. We then present a systematic way to generate the Pareto frontier …