Knowledge (XXG)

User:Erel Segal

Source đź“ť

16:
I am a researcher. When I write research papers, I often summarize the "related work" section in a Knowledge (XXG) page. Hopefully it can help other researchers working in related fields. Some of my contributions are below. My academic homepage is
2363: 789: 515: 146: 45: 171: 390: 1920: 1874: 784: 420: 1744: 725: 186: 2467: 2462: 2142: 283: 2342: 383: 1368: 2212: 191: 2327: 1509: 2202: 2024: 2584: 1715: 1056: 654: 2237: 1051: 869: 649: 1382: 1343: 1338: 1163: 1061: 880: 96: 2401: 2353: 1232: 875: 2593: 2337: 1866: 1168: 577: 273: 181: 1524: 1519: 2587: 1143: 905: 2389: 2312: 1720: 258: 1634: 2316: 1534: 1397: 1003: 681: 226: 216: 2590: 1432: 1252: 1227: 913: 535: 176: 2282: 2232: 1669: 1290: 988: 686: 136: 2556: 2286: 2274: 2252: 2197: 2187: 2000: 1980: 1915: 1758: 1684: 1472: 1386: 1348: 1272: 1247: 1128: 1086: 973: 754: 587: 555: 470: 465: 455: 151: 2217: 2005: 1790: 1750: 1584: 1564: 1447: 1358: 1298: 1217: 924: 885: 864: 758: 730: 642: 597: 521: 500: 253: 211: 101: 1754: 1257: 166: 141: 2332: 2278: 2207: 2157: 1822: 1549: 1323: 934: 929: 828: 510: 485: 450: 318: 2581: 2385: 2358: 2270: 2152: 1794: 1609: 1604: 1574: 1402: 1103: 1081: 823: 696: 572: 505: 490: 440: 293: 40: 196: 2482: 2437: 2418: 2257: 2177: 1704: 1699: 1554: 1076: 1066: 1014: 944: 900: 838: 671: 659: 545: 540: 353: 91: 76: 1762: 1639: 939: 2515: 2452: 2429: 2423: 2397: 2348: 2137: 1812: 1770: 1689: 1654: 1594: 1529: 1499: 1392: 1197: 1178: 1173: 1097: 1071: 1031: 998: 983: 742: 703: 601: 460: 415: 405: 303: 248: 2568: 2560: 2520: 2262: 2011: 1985: 1960: 1940: 1778: 1599: 1408: 1153: 955: 833: 818: 676: 550: 363: 86: 71: 50: 161: 111: 2578: 2433: 2300: 2172: 2088: 1950: 1847: 1832: 1674: 1504: 1442: 1363: 1138: 1133: 978: 410: 395: 343: 338: 278: 221: 116: 313: 2575: 2525: 2308: 2304: 2296: 2227: 2083: 2048: 2019: 1569: 1514: 1477: 1333: 1294: 1158: 1148: 1041: 632: 565: 480: 333: 263: 2457: 2411: 2393: 2292: 2266: 2242: 2063: 2043: 1852: 1559: 1539: 859: 664: 425: 268: 238: 156: 106: 66: 2564: 2477: 2222: 2167: 2098: 2078: 1995: 1990: 1945: 1837: 1725: 1579: 1457: 1416: 1262: 1237: 1212: 1091: 993: 949: 919: 909: 890: 850: 691: 622: 528: 445: 435: 1909: 2472: 2377: 2182: 2073: 2058: 1930: 1899: 1786: 1735: 1664: 1589: 1494: 1282: 1278: 1202: 737: 713: 617: 582: 430: 348: 288: 243: 121: 33: 2600: 2488: 2068: 2053: 1975: 1955: 1544: 1462: 1452: 1378: 1353: 1222: 1036: 854: 813: 808: 637: 612: 308: 298: 55: 2510: 2322: 2132: 1970: 1935: 1870: 1827: 1817: 1798: 1774: 1766: 1694: 1649: 1373: 1183: 1026: 961: 708: 495: 126: 2505: 1862: 1842: 1437: 1412: 1207: 607: 359: 328: 206: 60: 2162: 2147: 1739: 1709: 1420: 1328: 1267: 1242: 747: 718: 592: 475: 400: 375: 323: 201: 2094: 2015: 1904: 1858: 1730: 1659: 1467: 1286: 895: 627: 131: 81: 2369: 2192: 2102: 1965: 1046: 2535: 2531: 2373: 2038: 1782: 1679: 1644: 1924: 1008: 2381: 2247: 2158:
Hall's marriage theorem#Constructive proof of the hard direction
2127: 2116: 1888: 1623: 1312: 1117: 773: 24: 18: 516:
Approximate Competitive Equilibrium from Equal Incomes
46:
Proportional cake-cutting with different entitlements
2364:/Optimal algorithms with unknown runtime complexity 2478:Assignment problem#Solution by linear programming 172:Robertson–Webb envy-free cake-cutting algorithm 2599:My main contribution is in Hebrew Wikisource: 952:(also: perpetual voting, combinatorial voting) 421:Fair division of a single homogeneous resource 8: 790:/Moulin Fair Division and Collective Welfare 726:Efficient approximately-fair item allocation 147:Brams–Taylor–Zwicker moving knives procedure 2468:Minimum weight solution to linear equations 2463:Minimum relevant variables in linear system 2143:Non-constructive algorithm existence proofs 872:(also called: participatory budgeting rule) 284:Perfect matching in high-degree hypergraphs 2343:Fully polynomial-time approximation scheme 384:List of unsolved problems in fair division 2213:Pseudopolynomial time number partitioning 2328:Longest-processing-time-first scheduling 2203:Matroid-constrained number partitioning 2025:Template:Analogous fixed-point theorems 187:Robertson–Webb rotating-knife procedure 1716:Simplicial complex recognition problem 1057:Utility functions on indivisible goods 655:Utility functions on indivisible goods 2238:Karmarkar-Karp bin packing algorithms 1921:Knaster–Kuratowski–Mazurkiewicz lemma 1369:Kalai–Smorodinsky bargaining solution 1052:Gross substitutes (indivisible items) 870:Combinatorial participatory budgeting 650:Gross substitutes (indivisible items) 7: 1344:Facility location (competitive game) 1339:Facility location (cooperative game) 1164:Land reform in the Habsburg monarchy 1062:Utility functions on divisible goods 881:Participatory budgeting ballot types 192:Levmore–Cook moving-knives procedure 2402:Distributed constraint optimization 2354:Algorithmic problems on convex sets 1807:Probability Statistics and Learning 876:Participatory budgeting experiments 2338:Lexicographic max-min optimization 2138:Maximal independent set#Algorithms 1867:Uniform convergence to probability 1169:Land reform in the Austrian empire 578:Fair allocation of items and money 274:Hall-type theorems for hypergraphs 182:Stromquist moving-knives procedure 14: 1144:Land reform in the Roman republic 906:Fully proportional representation 63:(also called: consensus division) 1721:Subdivision (simplicial complex) 1233:Debreu's representation theorems 391:/Open questions in fair division 259:Dulmage-Mendelsohn decomposition 1875:/Probability and Computing 2006 1535:Monotonicity (mechanism design) 1510:Vickrey–Clarke–Groves mechanism 1398:Minimum-cost spanning tree game 1004:Rank-index apportionment method 785:/Mathematics and Democracy 2008 682:Random priority item allocation 97:Hill–Beck land division problem 1745:/Matveev on Algebraic Topology 1520:Gibbard–Satterthwaite theorem‎ 1433:First-price sealed-bid auction 1253:Market equilibrium computation 1228:Utility representation theorem 914:Chamberlin-Courant voting rule 536:Proportional rule (bankruptcy) 1: 2233:High-multiplicity bin packing 1670:Direction-preserving function 1525:Myerson–Satterthwaite theorem 1291:Optimal labor income taxation 989:State-population monotonicity 687:Simultaneous eating algorithm 137:Austin moving-knife procedure 2557:Elaboration likelihood model 2390:Gallai–Edmonds decomposition 2253:Configuration linear program 2198:Balanced number partitioning 2188:Multiway number partitioning 2001:Geometric discrepancy theory 1981:Discrete fixed-point theorem 1916:Steinhaus chessboard theorem 1759:Kakutani fixed point theorem 1685:Discrete fixed-point theorem 1473:Price of anarchy in auctions 1349:Perfect Bayesian equilibrium 1273:Fractional Pareto efficiency 1248:Arrow-Debreu exchange market 1129:Land reform in ancient Egypt 1087:Piecewise-constant valuation 974:Mathematics of apportionment 755:Welfare maximization problem 588:Proportional item allocation 556:Strategic bankruptcy problem 471:Efficient envy-free division 466:Partial allocation mechanism 456:Truthful resource allocation 2218:Largest differencing method 2006:Discrepancy of permutations 1791:Sigma-additive set function 1751:Brouwer fixed-point theorem 1585:Profit extraction mechanism 1565:Prior-independent mechanism 1448:Deferred-acceptance auction 1359:Alternating offers protocol 1218:Marshallian demand function 925:Multiwinner approval voting 886:Budget-proposal aggregation 865:Implicit utilitarian voting 759:utilitarian item allocation 731:Round-robin item allocation 643:Decreasing Demand procedure 598:Egalitarian item allocation 522:Proportional representation 501:Entitlement (fair division) 254:Vertex cover in hypergraphs 212:Symmetric fair cake-cutting 102:Super-proportional division 2617: 2333:Lexicographic optimization 2208:Greedy number partitioning 1823:Concentration inequalities 1550:Bayesian-optimal mechanism 1324:Folk theorem (game theory) 1094:(aka: utility measurement) 930:Fractional approval voting 829:Neutrality (social choice) 511:Dominant resource fairness 486:Fair division among groups 451:No-justified-envy matching 319:Truncated projective plane 227:Robertson–Webb query model 217:Stromquist–Woodall theorem 2386:Multiprocessor scheduling 2359:Minimum mean weight cycle 2153:Zero-weight cycle problem 1795:Link (simplicial complex) 1610:Budget-feasible mechanism 1605:Budget-balanced mechanism 1575:Random-sampling mechanism 1403:Compositional game theory 1104:Single peaked preferences 1082:Budget-additive valuation 824:Anonymity (social choice) 697:Random two-sided matching 573:Envy-free item allocation 506:Ordinal Pareto efficiency 491:Coherence (fair division) 441:Fair division experiments 294:Deficiency (graph theory) 177:Selfridge–Conway protocol 41:Proportional cake-cutting 2483:n-dimensional polyhedron 2438:Semidefinite programming 2419:Center-of-gravity method 2258:Strongly-polynomial time 2178:Maximally-matchable edge 1705:Homological connectivity 1700:Homotopical connectivity 1635:Poincaré–Miranda theorem 1555:Bayesian-optimal pricing 1077:Fractionally subadditive 1067:Single-parameter utility 1015:Apportionment by country 945:Expanding Approvals Rule 901:Justified representation 839:Fractional social choice 672:House allocation problem 660:Responsive set extension 546:Constrained equal losses 541:Constrained equal awards 354:Fractional spanning tree 92:Utilitarian cake-cutting 77:Egalitarian cake-cutting 19:http://erelsgl.github.io 2585:/Land reform by country 2516:Set intersection oracle 2453:Basic feasible solution 2430:Self-concordant barrier 2424:Square-root sum problem 2398:Maximum weight matching 2349:Optimal kidney exchange 1813:Lexicographic dominance 1771:Riemann mapping theorem 1690:Fixed-point computation 1655:Bauer maximum principle 1595:Rural hospitals theorem 1530:Truthful job scheduling 1500:Incentive compatibility 1393:Nucleolus (game theory) 1198:Competitive equilibrium 1179:Land reforms by country 1174:Land reform in Scotland 1098:Star-shaped preferences 1072:Dichotomous preferences 1032:Multi-attribute utility 999:Vote-ratio monotonicity 984:Balance (apportionment) 935:Phragmen's voting rules 743:School-choice mechanism 704:Rank-maximal allocation 602:Max-min item allocation 461:Strategic fair division 416:Population monotonicity 406:Egalitarian equivalence 304:Rainbow independent set 249:Matching in hypergraphs 152:Dubins–Spanier theorems 2569:Homotopic connectivity 2561:Social judgment theory 2521:Interleave lower bound 2263:Optimal job scheduling 2033:Computational Geometry 2012:Law of Excluded Middle 1986:Base-orderable matroid 1961:Biased positional game 1941:Strong positional game 1779:Colorful Helly theorem 1755:Knaster–Tarski theorem 1600:Cost-sharing mechanism 1409:Cooperative bargaining 1258:Pigou–Dalton principle 1154:Land reform in Prussia 956:Compilation complexity 834:Dictatorship mechanism 819:Proportional-fair rule 677:Fair random assignment 551:Contested garment rule 364:Conflict-free coloring 167:Edmonds–Pruhs protocol 142:Brams–Taylor procedure 87:Efficient cake-cutting 72:Equitable cake-cutting 51:Envy-free cake-cutting 2550:Sociology and Biology 2434:Interior-point method 2173:Rank-maximal matching 2089:Guillotine separation 1951:Avoider-Enforcer game 1848:Judgement aggregation 1833:Rademacher complexity 1675:Integrally-convex set 1629:Topology and analysis 1505:Regret-free mechanism 1443:Digital goods auction 1364:Sequential bargaining 1139:Land reform in Sparta 1134:Land reform in Athens 979:Optimal apportionment 940:Thiele's voting rules 411:Resource monotonicity 396:Proportional division 344:D-interval hypergraph 339:Width of a hypergraph 279:Width of a hypergraph 222:Truthful cake-cutting 117:Individual pieces set 2601:S:he:User:Erel_Segal 2526:Dynamic connectivity 2228:Bin covering problem 2084:Guillotine partition 2049:Maximum disjoint set 2020:Matroid intersection 1570:Prior-free mechanism 1515:Revelation principle 1478:Supply-chain auction 1334:Overtaking criterion 1295:Consumer sovereignty 1159:Land reform in Savoy 1149:Land reform in India 1042:Random utility model 633:envy-graph procedure 566:Fair item allocation 481:Online fair division 334:Independence complex 264:Bipartite hypergraph 197:Simmons–Su protocols 2594:/Multi-frame agents 2458:Dual linear program 2412:Convex optimization 2394:Hungarian algorithm 2293:Bin packing problem 2243:Multiple subset sum 2064:Rectilinear polygon 2044:Geometric separator 1853:Bayesian persuasion 1763:Stone–Tukey theorem 1640:Borsuk–Ulam theorem 1560:Algorithmic pricing 1540:Maskin monotonicity 1383:in congestion games 860:Average voting rule 665:Single-minded agent 426:Group envy-freeness 269:Balanced hypergraph 239:Fractional matching 107:Super envy-freeness 67:Problem of the Nile 2588:/Bitcoin economics 2565:Opinion leadership 2447:Linear programming 2283:Unrelated machines 2275:Identical machines 2223:Multifit algorithm 2168:Assignment problem 2099:Space partitioning 2079:Guillotine cutting 1996:Laminar set family 1991:Basis of a matroid 1946:Maker-breaker game 1838:Belief aggregation 1726:Chessboard complex 1580:Consensus estimate 1458:Sequential auction 1417:Backward induction 1263:Cardinal welfarism 1238:Throw away paradox 1213:Leontief utilities 1092:Utility assessment 994:House monotonicity 950:Multi-issue voting 920:Multiwinner voting 910:Monroe voting rule 891:Donor coordination 851:Median voting rule 692:Birkhoff algorithm 623:Undercut procedure 529:Bankruptcy problem 446:Envy-free matching 436:Fair river sharing 314:Ryser's conjecture 2546: 2545: 2473:Separation oracle 2378:Sample complexity 2183:Partition problem 2113: 2112: 2074:Rectangle packing 2059:Polygon partition 1931:Ramsey partitions 1885: 1884: 1736:Metric projection 1665:Selection theorem 1620: 1619: 1590:Virtual valuation 1495:Strategyproofness 1309: 1308: 1283:Pareto efficiency 1279:Emissions trading 1203:Gross substitutes 1114: 1113: 797: 794: 779: 770: 769: 738:Course allocation 714:Envy-free pricing 618:Top trading cycle 583:Envy minimization 431:Price of fairness 349:Priority matching 289:Normal hypergraph 244:Matching polytope 162:Even–Paz protocol 122:Divide and choose 112:Radon–Nikodym set 34:Fair cake-cutting 2608: 2279:Uniform machines 2117: 2069:Map segmentation 2054:Polygon covering 1976:Pairing strategy 1956:Discrepancy game 1889: 1624: 1545:Implementability 1489:Mechanism design 1463:Japanese auction 1453:Knapsack auction 1379:Price of anarchy 1374:Congestion games 1354:Matching pennies 1313: 1223:Abstract economy 1118: 1037:Additive utility 855:Median mechanism 814:Egalitarian rule 809:Utilitarian rule 796: 781: 778: 774: 638:A-CEEI mechanism 613:Picking sequence 309:Rainbow covering 299:Rainbow matching 157:Weller's theorem 56:Fair pie-cutting 25: 2616: 2615: 2611: 2610: 2609: 2607: 2606: 2605: 2591:/BKK procedures 2552: 2547: 2511:Distance oracle 2502: 2500:Data structures 2494: 2449: 2443: 2415: 2407: 2323:List scheduling 2133:Balls into bins 2124: 2114: 2035: 1971:Box-making game 1936:Positional game 1910:Sperner's lemma 1896: 1886: 1871:Covering number 1828:Growth function 1818:Correlation gap 1809: 1799:join (topology) 1775:Covering number 1767:Connected space 1695:Hole (topology) 1650:Concavification 1631: 1621: 1491: 1483: 1429: 1320: 1310: 1194: 1184:Pocket contract 1125: 1115: 1027:Ordinal utility 1023: 970: 962:Approval ballot 847: 805: 771: 709:Adjusted winner 569: 561: 532: 496:Surplus sharing 379: 369: 235: 127:Last diminisher 37: 29: 12: 11: 5: 2614: 2612: 2572: 2571: 2551: 2548: 2544: 2543: 2539: 2538: 2528: 2523: 2518: 2513: 2508: 2506:Dialog manager 2501: 2498: 2496: 2492: 2491: 2485: 2480: 2475: 2470: 2465: 2460: 2455: 2448: 2445: 2441: 2440: 2426: 2421: 2414: 2409: 2405: 2404: 2366: 2361: 2356: 2351: 2346: 2340: 2335: 2330: 2325: 2320: 2290: 2271:single machine 2260: 2255: 2250: 2245: 2240: 2235: 2230: 2225: 2220: 2215: 2210: 2205: 2200: 2195: 2190: 2185: 2180: 2175: 2170: 2165: 2160: 2155: 2150: 2145: 2140: 2135: 2130: 2123: 2120: 2115: 2111: 2110: 2106: 2105: 2091: 2086: 2081: 2076: 2071: 2066: 2061: 2056: 2051: 2046: 2041: 2034: 2031: 2029: 2028: 2027: 2022: 2008: 2003: 1998: 1993: 1988: 1983: 1978: 1973: 1968: 1963: 1958: 1953: 1948: 1943: 1938: 1933: 1928: 1918: 1913: 1907: 1902: 1900:Tucker's lemma 1895: 1892: 1887: 1883: 1882: 1878: 1877: 1863:Chernoff bound 1855: 1850: 1845: 1843:Belief merging 1840: 1835: 1830: 1825: 1820: 1815: 1808: 1805: 1803: 1802: 1801: 1787:Gordan's lemma 1747: 1742: 1733: 1728: 1723: 1718: 1713: 1707: 1702: 1697: 1692: 1687: 1682: 1677: 1672: 1667: 1662: 1657: 1652: 1647: 1642: 1637: 1630: 1627: 1622: 1618: 1617: 1613: 1612: 1607: 1602: 1597: 1592: 1587: 1582: 1577: 1572: 1567: 1562: 1557: 1552: 1547: 1542: 1537: 1532: 1527: 1522: 1517: 1512: 1507: 1502: 1497: 1490: 1487: 1485: 1481: 1480: 1475: 1470: 1465: 1460: 1455: 1450: 1445: 1440: 1438:Double auction 1435: 1428: 1427:Auction theory 1425: 1424: 1423: 1413:Signaling game 1405: 1400: 1395: 1390: 1376: 1371: 1366: 1361: 1356: 1351: 1346: 1341: 1336: 1331: 1326: 1319: 1316: 1311: 1307: 1306: 1302: 1301: 1275: 1270: 1265: 1260: 1255: 1250: 1245: 1240: 1235: 1230: 1225: 1220: 1215: 1210: 1208:Linear utility 1205: 1200: 1193: 1190: 1188: 1187: 1186: 1181: 1176: 1171: 1166: 1161: 1156: 1151: 1146: 1141: 1136: 1131: 1124: 1121: 1116: 1112: 1111: 1107: 1106: 1100: 1095: 1089: 1084: 1079: 1074: 1069: 1064: 1059: 1054: 1049: 1044: 1039: 1034: 1029: 1022: 1019: 1018: 1017: 1011: 1006: 1001: 996: 991: 986: 981: 976: 969: 966: 965: 964: 958: 953: 947: 942: 937: 932: 927: 922: 917: 903: 898: 893: 888: 883: 878: 873: 867: 862: 857: 846: 843: 842: 841: 836: 831: 826: 821: 816: 811: 804: 801: 799: 793: 792: 787: 772: 768: 767: 763: 762: 751: 750: 745: 740: 734: 733: 728: 722: 721: 716: 711: 706: 700: 699: 694: 689: 684: 679: 674: 668: 667: 662: 657: 652: 646: 645: 640: 635: 630: 625: 620: 615: 610: 608:Rental harmony 605: 595: 590: 585: 580: 575: 568: 563: 559: 558: 553: 548: 543: 538: 531: 526: 525: 524: 518: 513: 508: 503: 498: 493: 488: 483: 478: 473: 468: 463: 458: 453: 448: 443: 438: 433: 428: 423: 418: 413: 408: 403: 398: 393: 387: 378: 373: 371: 367: 366: 360:Dominating set 356: 351: 346: 341: 336: 331: 329:Graph homology 326: 321: 316: 311: 306: 301: 296: 291: 286: 281: 276: 271: 266: 261: 256: 251: 246: 241: 234: 231: 230: 229: 224: 219: 214: 209: 207:Chore division 204: 199: 194: 189: 184: 179: 174: 169: 164: 159: 154: 149: 144: 139: 134: 129: 124: 119: 114: 109: 104: 99: 94: 89: 84: 79: 74: 69: 64: 61:Exact division 58: 53: 48: 43: 36: 31: 23: 13: 10: 9: 6: 4: 3: 2: 2613: 2604: 2602: 2597: 2595: 2592: 2589: 2586: 2583: 2580: 2577: 2570: 2566: 2562: 2558: 2554: 2553: 2549: 2542: 2537: 2533: 2529: 2527: 2524: 2522: 2519: 2517: 2514: 2512: 2509: 2507: 2504: 2503: 2499: 2497: 2495: 2490: 2489:Farkas' lemma 2486: 2484: 2481: 2479: 2476: 2474: 2471: 2469: 2466: 2464: 2461: 2459: 2456: 2454: 2451: 2450: 2446: 2444: 2439: 2435: 2431: 2427: 2425: 2422: 2420: 2417: 2416: 2413: 2410: 2408: 2403: 2399: 2395: 2391: 2387: 2383: 2379: 2375: 2371: 2367: 2365: 2362: 2360: 2357: 2355: 2352: 2350: 2347: 2344: 2341: 2339: 2336: 2334: 2331: 2329: 2326: 2324: 2321: 2318: 2314: 2310: 2306: 2302: 2298: 2294: 2291: 2288: 2284: 2280: 2276: 2272: 2268: 2264: 2261: 2259: 2256: 2254: 2251: 2249: 2246: 2244: 2241: 2239: 2236: 2234: 2231: 2229: 2226: 2224: 2221: 2219: 2216: 2214: 2211: 2209: 2206: 2204: 2201: 2199: 2196: 2194: 2191: 2189: 2186: 2184: 2181: 2179: 2176: 2174: 2171: 2169: 2166: 2164: 2163:Hall violator 2161: 2159: 2156: 2154: 2151: 2149: 2148:Set balancing 2146: 2144: 2141: 2139: 2136: 2134: 2131: 2129: 2126: 2125: 2121: 2119: 2118: 2109: 2104: 2100: 2096: 2092: 2090: 2087: 2085: 2082: 2080: 2077: 2075: 2072: 2070: 2067: 2065: 2062: 2060: 2057: 2055: 2052: 2050: 2047: 2045: 2042: 2040: 2037: 2036: 2032: 2030: 2026: 2023: 2021: 2017: 2013: 2009: 2007: 2004: 2002: 1999: 1997: 1994: 1992: 1989: 1987: 1984: 1982: 1979: 1977: 1974: 1972: 1969: 1967: 1964: 1962: 1959: 1957: 1954: 1952: 1949: 1947: 1944: 1942: 1939: 1937: 1934: 1932: 1929: 1926: 1922: 1919: 1917: 1914: 1911: 1908: 1906: 1903: 1901: 1898: 1897: 1894:Combinatorics 1893: 1891: 1890: 1881: 1876: 1872: 1868: 1864: 1860: 1856: 1854: 1851: 1849: 1846: 1844: 1841: 1839: 1836: 1834: 1831: 1829: 1826: 1824: 1821: 1819: 1816: 1814: 1811: 1810: 1806: 1804: 1800: 1796: 1792: 1788: 1784: 1780: 1776: 1772: 1768: 1764: 1760: 1756: 1752: 1748: 1746: 1743: 1741: 1740:Chebyshev set 1737: 1734: 1732: 1729: 1727: 1724: 1722: 1719: 1717: 1714: 1711: 1710:Nerve complex 1708: 1706: 1703: 1701: 1698: 1696: 1693: 1691: 1688: 1686: 1683: 1681: 1678: 1676: 1673: 1671: 1668: 1666: 1663: 1661: 1658: 1656: 1653: 1651: 1648: 1646: 1643: 1641: 1638: 1636: 1633: 1632: 1628: 1626: 1625: 1616: 1611: 1608: 1606: 1603: 1601: 1598: 1596: 1593: 1591: 1588: 1586: 1583: 1581: 1578: 1576: 1573: 1571: 1568: 1566: 1563: 1561: 1558: 1556: 1553: 1551: 1548: 1546: 1543: 1541: 1538: 1536: 1533: 1531: 1528: 1526: 1523: 1521: 1518: 1516: 1513: 1511: 1508: 1506: 1503: 1501: 1498: 1496: 1493: 1492: 1488: 1486: 1484: 1479: 1476: 1474: 1471: 1469: 1466: 1464: 1461: 1459: 1456: 1454: 1451: 1449: 1446: 1444: 1441: 1439: 1436: 1434: 1431: 1430: 1426: 1422: 1421:Shapley value 1418: 1414: 1410: 1406: 1404: 1401: 1399: 1396: 1394: 1391: 1388: 1384: 1380: 1377: 1375: 1372: 1370: 1367: 1365: 1362: 1360: 1357: 1355: 1352: 1350: 1347: 1345: 1342: 1340: 1337: 1335: 1332: 1330: 1329:Bimatrix game 1327: 1325: 1322: 1321: 1317: 1315: 1314: 1305: 1300: 1296: 1292: 1288: 1284: 1280: 1276: 1274: 1271: 1269: 1268:Free disposal 1266: 1264: 1261: 1259: 1256: 1254: 1251: 1249: 1246: 1244: 1243:Fisher market 1241: 1239: 1236: 1234: 1231: 1229: 1226: 1224: 1221: 1219: 1216: 1214: 1211: 1209: 1206: 1204: 1201: 1199: 1196: 1195: 1191: 1189: 1185: 1182: 1180: 1177: 1175: 1172: 1170: 1167: 1165: 1162: 1160: 1157: 1155: 1152: 1150: 1147: 1145: 1142: 1140: 1137: 1135: 1132: 1130: 1127: 1126: 1122: 1120: 1119: 1110: 1105: 1101: 1099: 1096: 1093: 1090: 1088: 1085: 1083: 1080: 1078: 1075: 1073: 1070: 1068: 1065: 1063: 1060: 1058: 1055: 1053: 1050: 1048: 1045: 1043: 1040: 1038: 1035: 1033: 1030: 1028: 1025: 1024: 1020: 1016: 1012: 1010: 1007: 1005: 1002: 1000: 997: 995: 992: 990: 987: 985: 982: 980: 977: 975: 972: 971: 968:Apportionment 967: 963: 959: 957: 954: 951: 948: 946: 943: 941: 938: 936: 933: 931: 928: 926: 923: 921: 918: 915: 911: 907: 904: 902: 899: 897: 894: 892: 889: 887: 884: 882: 879: 877: 874: 871: 868: 866: 863: 861: 858: 856: 852: 849: 848: 844: 840: 837: 835: 832: 830: 827: 825: 822: 820: 817: 815: 812: 810: 807: 806: 803:Social choice 802: 800: 798: 791: 788: 786: 783: 782: 780: 776: 775: 766: 760: 756: 753: 752: 749: 748:Agreeable set 746: 744: 741: 739: 736: 735: 732: 729: 727: 724: 723: 720: 719:Demand oracle 717: 715: 712: 710: 707: 705: 702: 701: 698: 695: 693: 690: 688: 685: 683: 680: 678: 675: 673: 670: 669: 666: 663: 661: 658: 656: 653: 651: 648: 647: 644: 641: 639: 636: 634: 631: 629: 626: 624: 621: 619: 616: 614: 611: 609: 606: 603: 599: 596: 594: 593:Maximin-share 591: 589: 586: 584: 581: 579: 576: 574: 571: 570: 567: 564: 562: 557: 554: 552: 549: 547: 544: 542: 539: 537: 534: 533: 530: 527: 523: 519: 517: 514: 512: 509: 507: 504: 502: 499: 497: 494: 492: 489: 487: 484: 482: 479: 477: 476:Leximin order 474: 472: 469: 467: 464: 462: 459: 457: 454: 452: 449: 447: 444: 442: 439: 437: 434: 432: 429: 427: 424: 422: 419: 417: 414: 412: 409: 407: 404: 402: 401:Envy-freeness 399: 397: 394: 392: 388: 386: 385: 381: 380: 377: 376:Fair division 374: 372: 370: 365: 361: 357: 355: 352: 350: 347: 345: 342: 340: 337: 335: 332: 330: 327: 325: 324:Meshulam game 322: 320: 317: 315: 312: 310: 307: 305: 302: 300: 297: 295: 292: 290: 287: 285: 282: 280: 277: 275: 272: 270: 267: 265: 262: 260: 257: 255: 252: 250: 247: 245: 242: 240: 237: 236: 232: 228: 225: 223: 220: 218: 215: 213: 210: 208: 205: 203: 202:Fink protocol 200: 198: 195: 193: 190: 188: 185: 183: 180: 178: 175: 173: 170: 168: 165: 163: 160: 158: 155: 153: 150: 148: 145: 143: 140: 138: 135: 133: 130: 128: 125: 123: 120: 118: 115: 113: 110: 108: 105: 103: 100: 98: 95: 93: 90: 88: 85: 83: 80: 78: 75: 73: 70: 68: 65: 62: 59: 57: 54: 52: 49: 47: 44: 42: 39: 38: 35: 32: 30: 27: 26: 22: 20: 2598: 2573: 2540: 2493: 2442: 2406: 2107: 2095:Aspect ratio 2016:Matroid rank 1905:Ky Fan lemma 1879: 1859:VC dimension 1731:Deleted join 1660:Closed graph 1614: 1482: 1468:Jump bidding 1303: 1299:/Equilibrium 1287:Pareto front 1108: 896:Jury theorem 795: 777: 764: 628:AL procedure 560: 382: 368: 233:Graph theory 132:Lone divider 82:Equitability 28: 15: 2370:Set packing 2193:3-partition 2103:Treemapping 1966:Clique game 1387:in auctions 1318:Game theory 1047:Unit demand 1021:Preferences 2582:/Reduction 2536:Splay tree 2532:Tango tree 2374:Subset sum 2122:Algorithms 2039:Fat object 1783:CW complex 1680:Power cone 1645:L-infinity 389:Some more 2301:First-fit 1925:KKM lemma 1192:Economics 1009:Seat bias 2382:Makespan 2309:Harmonic 2305:Best-fit 2297:Next-fit 2287:Template 2267:Interval 1749:Minor: 2574:Draft: 2555:Minor: 2530:Minor: 2487:Minor: 2428:Minor: 2368:Minor: 2345:(FPTAS) 2093:Minor: 2010:Minor: 1912:(minor) 1857:Minor: 1712:(minor) 1407:Minor: 1277:Minor: 1102:Minor: 1013:Minor: 960:Minor: 908:- also 520:Minor: 358:Minor: 2579:/Draft 2541: 2108: 1880: 1615: 1304: 1109: 845:Voting 765: 2576:/Temp 2248:ADCOP 757:(aka 2128:3SUM 1123:Land 2317:NFD 2313:FFD 1385:, 1297:, 1293:, 2603:. 2596:- 2567:, 2563:, 2559:, 2534:, 2436:, 2432:, 2400:, 2396:, 2392:, 2388:, 2384:, 2380:, 2376:, 2372:, 2315:, 2311:, 2307:, 2303:, 2299:, 2295:: 2285:, 2281:, 2277:, 2273:, 2269:, 2265:: 2101:, 2097:, 2018:, 2014:, 1873:, 1869:, 1865:, 1861:, 1797:, 1793:, 1789:, 1785:, 1781:, 1777:, 1773:, 1769:, 1765:, 1761:, 1757:, 1753:, 1738:, 1419:, 1415:, 1411:, 1381:: 1289:, 1285:, 1281:, 912:, 853:= 362:, 21:. 2319:. 2289:. 1927:) 1923:( 1389:. 916:. 761:) 604:) 600:(

Index

http://erelsgl.github.io
Fair cake-cutting
Proportional cake-cutting
Proportional cake-cutting with different entitlements
Envy-free cake-cutting
Fair pie-cutting
Exact division
Problem of the Nile
Equitable cake-cutting
Egalitarian cake-cutting
Equitability
Efficient cake-cutting
Utilitarian cake-cutting
Hill–Beck land division problem
Super-proportional division
Super envy-freeness
Radon–Nikodym set
Individual pieces set
Divide and choose
Last diminisher
Lone divider
Austin moving-knife procedure
Brams–Taylor procedure
Brams–Taylor–Zwicker moving knives procedure
Dubins–Spanier theorems
Weller's theorem
Even–Paz protocol
Edmonds–Pruhs protocol
Robertson–Webb envy-free cake-cutting algorithm
Selfridge–Conway protocol

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑