[an error occurred while processing this directive]<meta name="keywords" content="Department of Computer Science, publications, by date, Nicholas Teh"></meta><meta name="description" content="Publications, by date, Department of Computer Science, Oxford, Nicholas Teh"></meta><title>Department of Computer Science, University of Oxford: Nicholas Teh : Publications
</title><style type="text/css">
			  .btn-toolbar::after, .btn-toolbar::before
			  {
			    content: " ";
			    display: table;
			  }

			
			.btn-toolbar
			{
			    margin-bottom: 2em;
			}

			  .btn-toolbar::after, .btn-group::after
			  {
			    clear: both;
			  }


			.btn-toolbar .btn, .btn-toolbar .btn-group
			  {
			    float: left;
			}
			
			.btn-group
			  {
			    display: inline-block;
			    position: relative;
			    vertical-align: middle;
			}

			  .btn-group > .btn:first-child:not(:last-child)
			  {
			    border-bottom-right-radius: 0;
			    border-top-right-radius: 0;
			}
			
			.btn-group > .btn:first-child
			  {
			    margin-left: 0;
			}

			.btn-group > .btn
			  {
			    float: left;
			    position: relative;
			}

			  .btn-group > .btn:not(:first-child):not(:last-child)
			  {
			    border-radius: 0;
			}
			
			  .btn-group > .btn:last-child:not(:first-child)
			  {
			    border-bottom-left-radius: 0;
			    border-top-left-radius: 0;
			}
			
			.btn-group .btn + .btn, .btn-group .btn + .btn-group, .btn-group .btn-group + .btn, .btn-group .btn-group + .btn-group
			  {
			    margin-left: -2px;
			}
			</style>[an error occurred while processing this directive]<div class="content-width"><ol class="breadcrumb text-uppercase"><li><a href="/">Home</a></li><li><a href="/aboutus/">About Us</a></li><li><a href="/people/">People</a></li><li><a href="/people/students.html">Students</a></li><li><a href="/people/Nicholas.Teh"><span itemprop="name">Nicholas Teh</span></a></li><li class="active">Publications</li></ol></div><!-- MOBILE NAVIGATION --><div class="content-width space-below mobile-menu-placeholder visible-xs visible-sm"></div><!-- COLUMNS --><div class="container-fluid content-width"><div class="row"><div class="col-xs-12 col-md-9 col-md-push-3" id="maincontent"><!-- CONTENT (Column 2) --><div class="page-title"><h1>Nicholas Teh : Publications
</h1></div><div role="toolbar" class="btn-toolbar"><div class="btn-group"><a href="/people/publications/date/Nicholas.Teh.html" aria-hidden="true" type="button" class="btn btn-oxford-blue"><span class="glyphicon glyphicon-sort-by-attributes"></span> By date</a><a href="/people/publications/title/Nicholas.Teh.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By title</a><a href="/people/publications/type/Nicholas.Teh.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By type</a><a href="/people/publications/bibtex/Nicholas.Teh.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-file"></span> BibTex</a></div></div><p></p><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Weighted Envy&#x2212;Freeness for Submodular Valuations </strong> </p>
	    <p class="publicationAuthors"> <em> Luisa Montanari&#x201a; Ulrike Schmidt&#x2212;Kraepelin&#x201a; Warut Suksompong and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proceedings of the AAAI Conference on Artificial Intelligence</em>.
        
            Vol. 38.
        
            No. 9.
        
                Pages 9865&#x2212;9873.
            March,
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16264-abstract.html">
			Details <span class="sr-only" > about <em> Weighted Envy&#x2212;Freeness for Submodular Valuations  </em></span> </a> |
			<a href="/publications/publication16264.bib">
			BibTeX  <span class="sr-only" > data for <em> Weighted Envy&#x2212;Freeness for Submodular Valuations  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1609/aaai.v38i9.28847">
		DOI (10.1609/aaai.v38i9.28847)
		</a> 
					| <a href="https://ojs.aaai.org/index.php/AAAI/article/view/28847"> Link <span class="sr-only" > to <em> Weighted Envy&#x2212;Freeness for Submodular Valuations  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Temporal Fairness in Multiwinner Voting </strong> </p>
	    <p class="publicationAuthors"> <em> Edith Elkind&#x201a; Svetlana Obraztsova and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proceedings of the AAAI Conference on Artificial Intelligence</em>.
        
            Vol. 38.
        
            No. 20.
        
                Pages 22633&#x2212;22640.
            March,
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16263-abstract.html">
			Details <span class="sr-only" > about <em> Temporal Fairness in Multiwinner Voting  </em></span> </a> |
			<a href="/publications/publication16263.bib">
			BibTeX  <span class="sr-only" > data for <em> Temporal Fairness in Multiwinner Voting  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1609/aaai.v38i20.30273">
		DOI (10.1609/aaai.v38i20.30273)
		</a> 
					| <a href="https://ojs.aaai.org/index.php/AAAI/article/view/30273"> Link <span class="sr-only" > to <em> Temporal Fairness in Multiwinner Voting  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Welfare Maximization in Perpetual Voting (Student Abstract) </strong> </p>
	    <p class="publicationAuthors"> <em> Tzeh Yuan Neoh and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proceedings of the AAAI Conference on Artificial Intelligence</em>.
        
            Vol. 38.
        
            No. 21.
        
                Pages 23597&#x2212;23599.
            March,
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16262-abstract.html">
			Details <span class="sr-only" > about <em> Welfare Maximization in Perpetual Voting (Student Abstract)  </em></span> </a> |
			<a href="/publications/publication16262.bib">
			BibTeX  <span class="sr-only" > data for <em> Welfare Maximization in Perpetual Voting (Student Abstract)  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1609/aaai.v38i21.30488">
		DOI (10.1609/aaai.v38i21.30488)
		</a> 
					| <a href="https://ojs.aaai.org/index.php/AAAI/article/view/30488"> Link <span class="sr-only" > to <em> Welfare Maximization in Perpetual Voting (Student Abstract)  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Envy&#x2212;free house allocation with minimum subsidy </strong> </p>
	    <p class="publicationAuthors"> <em> Davin Choo&#x201a; Yan Hao Ling&#x201a; Warut Suksompong&#x201a; Nicholas Teh and Jian Zhang  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Operations Research Letters</em>.
        
            Vol. 54.
        
                Pages 107103.
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16265-abstract.html">
			Details <span class="sr-only" > about <em> Envy&#x2212;free house allocation with minimum subsidy  </em></span> </a> |
			<a href="/publications/publication16265.bib">
			BibTeX  <span class="sr-only" > data for <em> Envy&#x2212;free house allocation with minimum subsidy  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/https://doi.org/10.1016/j.orl.2024.107103">
		DOI (https://doi.org/10.1016/j.orl.2024.107103)
		</a> 
					| <a href="https://www.sciencedirect.com/science/article/pii/S0167637724000397"> Link <span class="sr-only" > to <em> Envy&#x2212;free house allocation with minimum subsidy  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[5] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Fair Division of Chores with Budget Constraints </strong> </p>
	    <p class="publicationAuthors"> <em> Edith Elkind&#x201a; Ayumi Igarashi and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Algorithmic Game Theory</em>.
        
                Pages 55&#x2013;71.
            Springer Nature Switzerland.
        2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16439-abstract.html">
			Details <span class="sr-only" > about <em> Fair Division of Chores with Budget Constraints  </em></span> </a> |
			<a href="/publications/publication16439.bib">
			BibTeX  <span class="sr-only" > data for <em> Fair Division of Chores with Budget Constraints  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[6] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Distributive and Temporal Fairness in Algorithmic Collective Decision&#x2212;Making </strong> </p>
	    <p class="publicationAuthors"> <em> Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems</em>.
        
                Pages 2779&#x2013;2781.
            Richland&#x201a; SC.
        2024.
        International Foundation for Autonomous Agents and Multiagent Systems.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16297-abstract.html">
			Details <span class="sr-only" > about <em> Distributive and Temporal Fairness in Algorithmic Collective Decision&#x2212;Making  </em></span> </a> |
			<a href="/publications/publication16297.bib">
			BibTeX  <span class="sr-only" > data for <em> Distributive and Temporal Fairness in Algorithmic Collective Decision&#x2212;Making  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[7] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Verifying Proportionality in Temporal Voting </strong> </p>
	    <p class="publicationAuthors"> <em> Edith Elkind&#x201a; Svetlana Obraztsova and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems</em>.
        
                Pages 2246&#x2013;2248.
            Richland&#x201a; SC.
        2024.
        International Foundation for Autonomous Agents and Multiagent Systems.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication16296-abstract.html">
			Details <span class="sr-only" > about <em> Verifying Proportionality in Temporal Voting  </em></span> </a> |
			<a href="/publications/publication16296.bib">
			BibTeX  <span class="sr-only" > data for <em> Verifying Proportionality in Temporal Voting  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[8] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Weighted fair division with matroid&#x2212;rank valuations: Monotonicity and strategyproofness </strong> </p>
	    <p class="publicationAuthors"> <em> Warut Suksompong and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Mathematical Social Sciences</em>.
        
            Vol. 126.
        
                Pages 48&#x2212;59.
            2023.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15927-abstract.html">
			Details <span class="sr-only" > about <em> Weighted fair division with matroid&#x2212;rank valuations: Monotonicity and strategyproofness  </em></span> </a> |
			<a href="/publications/publication15927.bib">
			BibTeX  <span class="sr-only" > data for <em> Weighted fair division with matroid&#x2212;rank valuations: Monotonicity and strategyproofness  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/https://doi.org/10.1016/j.mathsocsci.2023.09.004">
		DOI (https://doi.org/10.1016/j.mathsocsci.2023.09.004)
		</a> 
					| <a href="https://www.sciencedirect.com/science/article/pii/S0165489623000793"> Link <span class="sr-only" > to <em> Weighted fair division with matroid&#x2212;rank valuations: Monotonicity and strategyproofness  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[9] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Settling the Score: Portioning with Cardinal Preferences </strong> </p>
	    <p class="publicationAuthors"> <em> Edith Elkind&#x201a; Warut Suksompong and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 26th European Conference on Artificial Intelligence (ECAI)</em>.
        
                Pages 621&#x2013;628.
            2023.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15918-abstract.html">
			Details <span class="sr-only" > about <em> Settling the Score: Portioning with Cardinal Preferences  </em></span> </a> |
			<a href="/publications/publication15918.bib">
			BibTeX  <span class="sr-only" > data for <em> Settling the Score: Portioning with Cardinal Preferences  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.3233/FAIA230324">
		DOI (10.3233/FAIA230324)
		</a> 
					| <a href="https://ebooks.iospress.nl/volumearticle/64256"> Link <span class="sr-only" > to <em> Settling the Score: Portioning with Cardinal Preferences  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[10] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Weighted Fair Division with Matroid&#x2212;Rank Valuations: Monotonicity and Strategyproofness </strong> </p>
	    <p class="publicationAuthors"> <em> Warut Suksompong and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Algorithmic Game Theory</em>.
        
                Pages xxiii&#x2013;xxiv.
            Springer International Publishing.
        2023.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15909-abstract.html">
			Details <span class="sr-only" > about <em> Weighted Fair Division with Matroid&#x2212;Rank Valuations: Monotonicity and Strategyproofness  </em></span> </a> |
			<a href="/publications/publication15909.bib">
			BibTeX  <span class="sr-only" > data for <em> Weighted Fair Division with Matroid&#x2212;Rank Valuations: Monotonicity and Strategyproofness  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/https://doi.org/10.1007/978-3-031-43254-5">
		DOI (https://doi.org/10.1007/978-3-031-43254-5)
		</a> 
					| <a href="http://link.springer.com/content/pdf/bfm:978-3-031-43254-5/1?pdf#page=16"> Link <span class="sr-only" > to <em> Weighted Fair Division with Matroid&#x2212;Rank Valuations: Monotonicity and Strategyproofness  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[11] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods </strong> </p>
	    <p class="publicationAuthors"> <em> Jonathan Scarlett&#x201a; Nicholas Teh and Yair Zick  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems</em>.
        
                Pages 2466&#x2013;2468.
            Richland&#x201a; SC.
        2023.
        International Foundation for Autonomous Agents and Multiagent Systems.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15858-abstract.html">
			Details <span class="sr-only" > about <em> For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods  </em></span> </a> |
			<a href="/publications/publication15858.bib">
			BibTeX  <span class="sr-only" > data for <em> For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[12] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On Maximum Weighted Nash Welfare for Binary Valuations </strong> </p>
	    <p class="publicationAuthors"> <em> Warut Suksompong and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Mathematical Social Sciences</em>.
        
            Vol. 117.
        
                Pages 101&#x2212;108.
            2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15772-abstract.html">
			Details <span class="sr-only" > about <em> On Maximum Weighted Nash Welfare for Binary Valuations  </em></span> </a> |
			<a href="/publications/publication15772.bib">
			BibTeX  <span class="sr-only" > data for <em> On Maximum Weighted Nash Welfare for Binary Valuations  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/https://doi.org/10.1016/j.mathsocsci.2022.03.004">
		DOI (https://doi.org/10.1016/j.mathsocsci.2022.03.004)
		</a> 
					| <a href="https://www.sciencedirect.com/science/article/pii/S0165489622000282"> Link <span class="sr-only" > to <em> On Maximum Weighted Nash Welfare for Binary Valuations  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[13] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Fairness in Temporal Slot Assignment </strong> </p>
	    <p class="publicationAuthors"> <em> Edith Elkind&#x201a; Sonja Kraiczy and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Algorithmic Game Theory</em>.
        
                Pages 490&#x2013;507.
            Springer International Publishing.
        2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15775-abstract.html">
			Details <span class="sr-only" > about <em> Fairness in Temporal Slot Assignment  </em></span> </a> |
			<a href="/publications/publication15775.bib">
			BibTeX  <span class="sr-only" > data for <em> Fairness in Temporal Slot Assignment  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/https://doi.org/10.1007/978-3-031-15714-1_28">
		DOI (https://doi.org/10.1007/978-3-031-15714-1_28)
		</a> 
					| <a href="https://link.springer.com/chapter/10.1007/978-3-031-15714-1_28"> Link <span class="sr-only" > to <em> Fairness in Temporal Slot Assignment  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[14] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Better Collective Decisions via Uncertainty Reduction </strong> </p>
	    <p class="publicationAuthors"> <em> Shiri Alouf&#x2212;Heffetz&#x201a; Laurent Bulteau&#x201a; Edith Elkind&#x201a; Nimrod Talmon and Nicholas Teh  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Thirty&#x2212;First International Joint Conference on Artificial Intelligence&#x201a; IJCAI&#x2212;22</em>.
        
                Pages 24&#x2013;30.
            International Joint Conferences on Artificial Intelligence Organization.
        2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15773-abstract.html">
			Details <span class="sr-only" > about <em> Better Collective Decisions via Uncertainty Reduction  </em></span> </a> |
			<a href="/publications/publication15773.bib">
			BibTeX  <span class="sr-only" > data for <em> Better Collective Decisions via Uncertainty Reduction  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.24963/ijcai.2022/4">
		DOI (10.24963/ijcai.2022/4)
		</a> 
					| <a href="https://doi.org/10.24963/ijcai.2022/4"> Link <span class="sr-only" > to <em> Better Collective Decisions via Uncertainty Reduction  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li></ul></div><div class="col-xs-12 col-md-3 col-md-pull-9 side-menu-col"><h2 class="side-menu-title text-uppercase"><a href="#">About Us</a></h2><ul class="side-menu"><li class="active mobile-menu-source"><a href="/people/">People</a><ul><li><a href="/people/faculty.html">Faculty</a></li><li><a href="/people/research.html">Research</a></li><li class="active"><a href="/people/students.html">Students</a></li><li><a href="/people/support.html">Professional Services</a></li><li><a href="/people/visitingprofessors.html">Visiting Professors</a></li><li><a href="/people/emeritusfaculty.html">Emeritus Faculty</a></li></ul></li><li><a href="/aboutus/vacancies/">Vacancies</a></li><li><a href="/aboutus/women-cs-oxford/index.html">Women in the department</a></li><li><a href="/aboutus/equality-diversity-inclusion/index.html">Equality, diversity and inclusion</a></li><li><a href="https://www.alumniweb.ox.ac.uk/cs/make-a-donation">Support Us</a></li><li><a href="/aboutus/cshistory.html">Our History</a></li><li><a href="/aboutus/contact.html">Contact Us</a></li></ul></div></div></div>[an error occurred while processing this directive]