Systems and methods for organizing participants of service platform

A technology of team formation and recommendation method, which is applied in the field of team formation system for team members from online to offline service platforms, and can solve problems such as the inability to form a team of drivers

Pending Publication Date: 2020-08-21
BEIJING DIDI INFINITY TECH & DEV
View PDF12 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the existing technology usually adopts the offline team formation method, which cannot realize the convenient formation of the driver team

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Systems and methods for organizing participants of service platform
  • Systems and methods for organizing participants of service platform
  • Systems and methods for organizing participants of service platform

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0167] In this example, n team members to be grouped are willing to accept m team members to be grouped, which can be expressed as an acceptance intention matrix Q, as shown in equation (5):

[0168]

[0169] Among them, c ij Indicates the captain l j Whether to accept player m i .c ij Whether the following constraints are satisfied:

[0170]

[0171] That is to say, c ij Can be 0 or 1. when c ij = 0, it may mean that the captain l j no intention to accept player m i ; when c ij = 1, it means the captain l j Interested in accepting team members m i . In addition, because b ij Indicates the player m i Is it recommended to Captain l j . when c ij =0, that is, the captain m i not recommended for captain l j when captain l j Cannot receive player m i , so c ij Can be set to 0. when b ij = 1, that is, player m i recommended to captain l j , the captain l can be selected according to his / her own intention j , namely c ij Can be 0 or 1. In some embod...

example 2

[0188] Suppose M denotes the maximum number (or count) of players allowed on each team, q i Indicates that it belongs to the captain l i The number (or count) of the team's players, then the number (or count) of the team's players needs to be M-q i .In this case, the total number (or count) of players recommended for each team is a i =a(M-q i ), where a is a constant. For example, a could be 2, indicating that the recommended number (or count) is twice the number (or count) of missing players. further assumption Indicates when another (α indicates when) the captain accepts the player when captain l i can with team members The probability of successfully forming a team, where the team members Represents the gth player in the kth combination. Then there are:

[0189]

[0190] Among them, len(Lj) indicates the recommended team members The number (or count) of captains. In addition, it can be determined with the captain l i and team members The success rate ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A system and method for determining a team are provided. The method may include obtaining information relating to each of a plurality of participants to be grouped, the plurality of participants including a plurality of team leaders and a plurality of team members. The method may also include determining one or more teams by automatically allocating the plurality of team members to the plurality of team leaders based on the information relating to the plurality of participants, wherein each of the one or more teams includes a team leader and at least one team member.

Description

[0001] priority statement [0002] This application claims the Chinese application with application number 201810141843.1 filed on February 11, 2018, the Chinese application with application number 201810499757.8 filed on May 23, 2018, and the Chinese application with application number 201810499757.8 filed on June 11, 2018 The priority of Chinese application 201810596480.0, the entire content of which is hereby incorporated by reference. technical field [0003] This application generally relates to an online-to-offline service platform, and in particular to a team formation system and method for members of an online-to-offline service platform. Background technique [0004] With the continuous development of the Internet economy, more and more Internet-based services have emerged, such as online taxi services, food delivery, express delivery, and driver services. Take the example of an online ride-hailing service. Online taxi booking is also known as online taxi booking....

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G08G1/00
CPCG08G1/202G06Q10/063118G06Q10/06315
Inventor 张凌宇曾琳马宁刘博王小雪陈晨
Owner BEIJING DIDI INFINITY TECH & DEV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap