满足理想化原则的公平席位分配方法

The Fair Seat Distribution Method Satisfying Idealistic Principle

为了找出能同时满足两条理想化原则的公平席位分配方法,首先确定席位分配的周期,然后确定出席位在一个周期内的分配顺序,按顺序进行席位分配,并在分配过程中施行席位的"给与"与"回收",最终确定出一个通用的公平席位分配方案表.采用C++语言编程实现.结果表明:"给与"与"回收"的操作能满足理想化原则一的要求,预先确定分配顺序的方法能满足理想化原则二的要求.

A fair seat distribution method is produced to satisfy idealistic principle. The algorithm is that first the sequence of distribution is produced, then seats are distributed by the sequence. In the algorithm, giving and returning are used. The method is made to the touth by C＋＋ . The result shows that giving and returning make the method satisfy the first part of idealistic principle, and the sequence makes the method satisfy the second part of idealistic principle.