Server-Based Rival Selection for Learning Engagement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
There is a need to increase user motivation for viewing content, particularly in learning applications, as existing systems lack effective mechanisms to engage users by comparing their progress with peers.
Innovation Solution
A server-based system that selects rival users based on viewing states from multiple communication terminals, transmitting this information back to the user's terminal to display their progress relative to others, thereby fostering competition and motivation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a server-based system collects and processes viewing state data from multiple communication terminals to select rival users, then user motivation and engagement are improved, but device complexity and data processing requirements increase
Solution Approach 1:
A server acts as an intermediary between multiple communication terminals, collecting viewing state data, processing it to select rival users, and transmitting the results back to terminals. This mediator approach allows complex data processing to be centralized while keeping individual terminals relatively simple, resolving the contradiction between improved user motivation and reduced device complexity at the terminal level.
2Productivity
If the system transmits viewing state information between server and communication terminals to enable rival user selection, then user engagement improves, but communication data usage and network load increase
Solution Approach 1:
The system extracts only the essential viewing state information needed for rival user selection and transmits only this processed data between server and terminals. By taking out and transmitting only the necessary data elements rather than complete viewing histories, the system maintains user engagement while minimizing communication data usage.
3Productivity
If the server dynamically updates rival users based on viewing states, then competitive motivation is maintained, but processing time and computational resources increase
Solution Approach 1:
The server performs dynamic updates of rival users at periodic intervals rather than continuously. This periodic action maintains competitive motivation by regularly refreshing rival user assignments while avoiding the excessive processing time and computational resources that would result from continuous real-time updates.
Data Source
AI summary
A server includes: a processor, a transmitter/receiver to communicate with a communication terminal and a plurality of other communication terminals, and a storage storing instructions. The processor executes the instructions to: select at least one first user among the plurality of other users based on a viewing state indicating extent of viewing of content by a user, which is stored in a storage of the communication terminal, and a plurality of other viewing states by each of a plurality of other users, each indicating extent of viewing of the content, which is stored in a storage of each of the plurality of other communication terminals; and control the transmitter/receiver of the server to output information indicating at least one first other viewing state corresponding to the selected at least one first user among the plurality of other viewing states.